/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-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:06:33,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:06:33,786 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:33,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:06:33,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:06:33,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:06:33,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:06:33,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:06:33,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:06:33,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:06:33,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:06:33,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:06:33,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:06:33,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:06:33,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:33,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:33,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:33,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:06:33,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:06:33,809 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:34,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:06:34,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:06:34,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:06:34,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:06:34,024 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:06:34,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 17:06:35,339 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35cfffda/6e282cd7eae04eb5bc7f8db598027438/FLAG288893b6e [2025-04-13 17:06:35,621 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:06:35,622 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 17:06:35,638 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35cfffda/6e282cd7eae04eb5bc7f8db598027438/FLAG288893b6e [2025-04-13 17:06:36,389 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35cfffda/6e282cd7eae04eb5bc7f8db598027438 [2025-04-13 17:06:36,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:06:36,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:06:36,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:36,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:06:36,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:06:36,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647543c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36, skipping insertion in model container [2025-04-13 17:06:36,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:06:36,681 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-longer-2.i[30963,30976] [2025-04-13 17:06:36,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:36,693 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:06:36,767 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-longer-2.i[30963,30976] [2025-04-13 17:06:36,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:36,797 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:06:36,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36 WrapperNode [2025-04-13 17:06:36,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:36,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:36,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:06:36,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:06:36,804 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:36" (1/1) ... [2025-04-13 17:06:36,812 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:36" (1/1) ... [2025-04-13 17:06:36,824 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 17:06:36,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:36,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:06:36,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:06:36,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:06:36,830 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:36" (1/1) ... [2025-04-13 17:06:36,830 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:36" (1/1) ... [2025-04-13 17:06:36,834 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:36" (1/1) ... [2025-04-13 17:06:36,847 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:36,847 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:36" (1/1) ... [2025-04-13 17:06:36,847 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:36" (1/1) ... [2025-04-13 17:06:36,850 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:36" (1/1) ... [2025-04-13 17:06:36,853 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:36" (1/1) ... [2025-04-13 17:06:36,855 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:36" (1/1) ... [2025-04-13 17:06:36,856 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:36" (1/1) ... [2025-04-13 17:06:36,856 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:36" (1/1) ... [2025-04-13 17:06:36,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:06:36,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:06:36,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:06:36,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:06:36,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:36,884 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:36,889 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:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:06:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:06:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:06:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:06:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:06:36,903 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:36,981 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:06:36,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:06:37,054 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:06:37,055 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:06:37,055 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:06:37,110 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:37,114 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:37,117 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:06:37,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:37 BoogieIcfgContainer [2025-04-13 17:06:37,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:06:37,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:06:37,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:06:37,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:06:37,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:06:36" (1/3) ... [2025-04-13 17:06:37,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab51313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:37, skipping insertion in model container [2025-04-13 17:06:37,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (2/3) ... [2025-04-13 17:06:37,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab51313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:37, skipping insertion in model container [2025-04-13 17:06:37,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:37" (3/3) ... [2025-04-13 17:06:37,124 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-04-13 17:06:37,134 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:06:37,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-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:37,135 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:06:37,159 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:06:37,178 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 17:06:37,202 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:37,222 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:06:37,229 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;@54d23921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:06:37,229 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:06:37,233 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:37,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:06:37,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:37,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:37,237 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:37,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1193666932, now seen corresponding path program 1 times [2025-04-13 17:06:37,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:37,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083744158] [2025-04-13 17:06:37,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:06:37,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:06:37,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:37,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:37,552 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:37,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:37,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083744158] [2025-04-13 17:06:37,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083744158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:37,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:06:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138173251] [2025-04-13 17:06:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:37,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:06:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:06:37,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:06:37,577 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:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:37,741 INFO L93 Difference]: Finished difference Result 173 states and 519 transitions. [2025-04-13 17:06:37,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:37,743 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:37,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:37,748 INFO L225 Difference]: With dead ends: 173 [2025-04-13 17:06:37,748 INFO L226 Difference]: Without dead ends: 105 [2025-04-13 17:06:37,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:06:37,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:37,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-13 17:06:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-04-13 17:06:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.6666666666666665) internal successors, (272), 102 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:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 272 transitions. [2025-04-13 17:06:37,781 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 272 transitions. Word has length 8 [2025-04-13 17:06:37,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:37,781 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 272 transitions. [2025-04-13 17:06:37,781 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:37,781 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 272 transitions. [2025-04-13 17:06:37,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:37,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:37,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:37,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:06:37,782 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:37,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1461782002, now seen corresponding path program 1 times [2025-04-13 17:06:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:37,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990755068] [2025-04-13 17:06:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:37,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:37,917 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:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:37,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990755068] [2025-04-13 17:06:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990755068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:37,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:06:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589416333] [2025-04-13 17:06:37,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:37,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:06:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:37,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:06:37,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:37,919 INFO L87 Difference]: Start difference. First operand 103 states and 272 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:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,019 INFO L93 Difference]: Finished difference Result 133 states and 353 transitions. [2025-04-13 17:06:38,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:06:38,019 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:38,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,020 INFO L225 Difference]: With dead ends: 133 [2025-04-13 17:06:38,020 INFO L226 Difference]: Without dead ends: 106 [2025-04-13 17:06:38,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:06:38,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:38,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-13 17:06:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-04-13 17:06:38,026 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:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 250 transitions. [2025-04-13 17:06:38,027 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 250 transitions. Word has length 10 [2025-04-13 17:06:38,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,028 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 250 transitions. [2025-04-13 17:06:38,028 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:38,028 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 250 transitions. [2025-04-13 17:06:38,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:38,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:06:38,029 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:38,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -113514130, now seen corresponding path program 1 times [2025-04-13 17:06:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601217799] [2025-04-13 17:06:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,143 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:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601217799] [2025-04-13 17:06:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601217799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:06:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345585645] [2025-04-13 17:06:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:06:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:06:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:38,144 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:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,254 INFO L93 Difference]: Finished difference Result 156 states and 417 transitions. [2025-04-13 17:06:38,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:38,254 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:38,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,255 INFO L225 Difference]: With dead ends: 156 [2025-04-13 17:06:38,255 INFO L226 Difference]: Without dead ends: 115 [2025-04-13 17:06:38,256 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:38,256 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:38,256 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:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-13 17:06:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-04-13 17:06:38,264 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:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 272 transitions. [2025-04-13 17:06:38,265 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 272 transitions. Word has length 10 [2025-04-13 17:06:38,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,265 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 272 transitions. [2025-04-13 17:06:38,265 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:38,266 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 272 transitions. [2025-04-13 17:06:38,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:06:38,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:06:38,266 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:38,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash -74058640, now seen corresponding path program 1 times [2025-04-13 17:06:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998050528] [2025-04-13 17:06:38,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:06:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:06:38,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,369 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:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998050528] [2025-04-13 17:06:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998050528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:38,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:06:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795947311] [2025-04-13 17:06:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:06:38,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:06:38,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:06:38,371 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:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,535 INFO L93 Difference]: Finished difference Result 199 states and 543 transitions. [2025-04-13 17:06:38,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:06:38,536 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:38,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,537 INFO L225 Difference]: With dead ends: 199 [2025-04-13 17:06:38,537 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 17:06:38,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:06:38,538 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:38,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 17:06:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2025-04-13 17:06:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.6792452830188678) internal successors, (284), 106 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:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 284 transitions. [2025-04-13 17:06:38,548 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 284 transitions. Word has length 12 [2025-04-13 17:06:38,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,549 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 284 transitions. [2025-04-13 17:06:38,549 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:38,549 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 284 transitions. [2025-04-13 17:06:38,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:06:38,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,549 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:06:38,554 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:38,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1634276771, now seen corresponding path program 1 times [2025-04-13 17:06:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498368163] [2025-04-13 17:06:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:38,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:38,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,664 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:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498368163] [2025-04-13 17:06:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498368163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:38,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381689890] [2025-04-13 17:06:38,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:38,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:38,666 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:38,668 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:38,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:38,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:06:38,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:38,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:06:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381689890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:06:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-13 17:06:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652764870] [2025-04-13 17:06:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:06:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:06:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:06:38,787 INFO L87 Difference]: Start difference. First operand 107 states and 284 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,978 INFO L93 Difference]: Finished difference Result 248 states and 667 transitions. [2025-04-13 17:06:38,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:06:38,978 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:38,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,980 INFO L225 Difference]: With dead ends: 248 [2025-04-13 17:06:38,980 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 17:06:38,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:06:38,981 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 79 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:38,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 3 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 17:06:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2025-04-13 17:06:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.6901408450704225) internal successors, (382), 142 states have internal predecessors, (382), 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:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 382 transitions. [2025-04-13 17:06:38,992 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 382 transitions. Word has length 14 [2025-04-13 17:06:38,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,992 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 382 transitions. [2025-04-13 17:06:38,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:38,992 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 382 transitions. [2025-04-13 17:06:38,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:06:38,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,993 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:39,001 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:39,194 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:39,194 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:39,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1206946781, now seen corresponding path program 2 times [2025-04-13 17:06:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:39,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034189599] [2025-04-13 17:06:39,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:39,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:06:39,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:39,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,280 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:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:39,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034189599] [2025-04-13 17:06:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034189599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:39,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400132381] [2025-04-13 17:06:39,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:39,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:39,284 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:39,285 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:39,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:06:39,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:39,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:06:39,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:39,375 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:39,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:39,500 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:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400132381] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:39,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 17:06:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980363101] [2025-04-13 17:06:39,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:39,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:06:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:39,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:06:39,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:06:39,502 INFO L87 Difference]: Start difference. First operand 143 states and 382 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:39,762 INFO L93 Difference]: Finished difference Result 297 states and 807 transitions. [2025-04-13 17:06:39,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:06:39,762 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 17:06:39,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:39,764 INFO L225 Difference]: With dead ends: 297 [2025-04-13 17:06:39,764 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 17:06:39,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:06:39,765 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 173 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:39,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 6 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 17:06:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2025-04-13 17:06:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.6125) internal successors, (418), 160 states have internal predecessors, (418), 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:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 418 transitions. [2025-04-13 17:06:39,772 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 418 transitions. Word has length 14 [2025-04-13 17:06:39,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:39,772 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 418 transitions. [2025-04-13 17:06:39,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,773 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 418 transitions. [2025-04-13 17:06:39,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:06:39,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:39,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:39,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:06:39,978 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:39,978 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:39,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1775987588, now seen corresponding path program 1 times [2025-04-13 17:06:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:39,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649842075] [2025-04-13 17:06:39,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:39,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:06:39,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:06:39,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:39,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:40,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649842075] [2025-04-13 17:06:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649842075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:40,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173874392] [2025-04-13 17:06:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:40,066 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:40,067 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:40,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:06:40,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:06:40,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:40,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:06:40,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173874392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:40,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 17:06:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529001892] [2025-04-13 17:06:40,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:40,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:06:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:40,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:06:40,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:06:40,230 INFO L87 Difference]: Start difference. First operand 161 states and 418 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:40,647 INFO L93 Difference]: Finished difference Result 405 states and 1113 transitions. [2025-04-13 17:06:40,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:06:40,648 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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 16 [2025-04-13 17:06:40,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:40,650 INFO L225 Difference]: With dead ends: 405 [2025-04-13 17:06:40,650 INFO L226 Difference]: Without dead ends: 247 [2025-04-13 17:06:40,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:06:40,652 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:40,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-13 17:06:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 171. [2025-04-13 17:06:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.6470588235294117) internal successors, (450), 170 states have internal predecessors, (450), 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:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 450 transitions. [2025-04-13 17:06:40,664 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 450 transitions. Word has length 16 [2025-04-13 17:06:40,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:40,664 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 450 transitions. [2025-04-13 17:06:40,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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:40,664 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 450 transitions. [2025-04-13 17:06:40,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:06:40,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:40,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:40,671 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:40,865 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:40,866 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:40,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -44083554, now seen corresponding path program 2 times [2025-04-13 17:06:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:40,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473182714] [2025-04-13 17:06:40,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:40,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:06:40,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:06:40,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:41,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473182714] [2025-04-13 17:06:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473182714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:41,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479881318] [2025-04-13 17:06:41,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:41,020 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:41,022 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:41,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:06:41,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:06:41,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:41,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:41,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:06:41,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:41,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479881318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:41,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-13 17:06:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780596672] [2025-04-13 17:06:41,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:41,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:06:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:41,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:06:41,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:06:41,249 INFO L87 Difference]: Start difference. First operand 171 states and 450 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:42,078 INFO L93 Difference]: Finished difference Result 609 states and 1717 transitions. [2025-04-13 17:06:42,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 17:06:42,082 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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 24 [2025-04-13 17:06:42,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:42,084 INFO L225 Difference]: With dead ends: 609 [2025-04-13 17:06:42,084 INFO L226 Difference]: Without dead ends: 369 [2025-04-13 17:06:42,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1133, Invalid=3027, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 17:06:42,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:42,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-04-13 17:06:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 271. [2025-04-13 17:06:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.6666666666666665) internal successors, (720), 270 states have internal predecessors, (720), 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,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 720 transitions. [2025-04-13 17:06:42,094 INFO L79 Accepts]: Start accepts. Automaton has 271 states and 720 transitions. Word has length 24 [2025-04-13 17:06:42,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:42,094 INFO L485 AbstractCegarLoop]: Abstraction has 271 states and 720 transitions. [2025-04-13 17:06:42,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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,094 INFO L278 IsEmpty]: Start isEmpty. Operand 271 states and 720 transitions. [2025-04-13 17:06:42,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 17:06:42,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:42,095 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:42,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:42,296 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:42,296 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:42,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1607421564, now seen corresponding path program 3 times [2025-04-13 17:06:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:42,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49054855] [2025-04-13 17:06:42,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-04-13 17:06:42,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:06:42,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49054855] [2025-04-13 17:06:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49054855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:42,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691334972] [2025-04-13 17:06:42,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:42,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:42,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:42,540 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:42,541 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:42,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-04-13 17:06:42,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:06:42,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:42,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:06:42,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691334972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:42,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-13 17:06:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527094855] [2025-04-13 17:06:42,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:42,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:06:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:42,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:06:42,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:06:42,905 INFO L87 Difference]: Start difference. First operand 271 states and 720 transitions. Second operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 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,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:43,768 INFO L93 Difference]: Finished difference Result 643 states and 1775 transitions. [2025-04-13 17:06:43,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:06:43,769 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 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 36 [2025-04-13 17:06:43,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:43,771 INFO L225 Difference]: With dead ends: 643 [2025-04-13 17:06:43,772 INFO L226 Difference]: Without dead ends: 485 [2025-04-13 17:06:43,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1611, Invalid=4551, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 17:06:43,775 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 546 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:43,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-13 17:06:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 291. [2025-04-13 17:06:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.6551724137931036) internal successors, (770), 290 states have internal predecessors, (770), 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,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 770 transitions. [2025-04-13 17:06:43,787 INFO L79 Accepts]: Start accepts. Automaton has 291 states and 770 transitions. Word has length 36 [2025-04-13 17:06:43,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:43,787 INFO L485 AbstractCegarLoop]: Abstraction has 291 states and 770 transitions. [2025-04-13 17:06:43,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 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,788 INFO L278 IsEmpty]: Start isEmpty. Operand 291 states and 770 transitions. [2025-04-13 17:06:43,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 17:06:43,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:43,788 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:43,796 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:43,990 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:43,990 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:43,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -702286306, now seen corresponding path program 4 times [2025-04-13 17:06:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:43,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916669934] [2025-04-13 17:06:43,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:43,995 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 17:06:44,002 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 17:06:44,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:44,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:44,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916669934] [2025-04-13 17:06:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916669934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:44,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952161257] [2025-04-13 17:06:44,284 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:44,286 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:44,287 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:44,317 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 17:06:44,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 17:06:44,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:44,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 17:06:44,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952161257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:44,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 28 [2025-04-13 17:06:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463837028] [2025-04-13 17:06:44,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:44,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:06:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:06:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:06:44,641 INFO L87 Difference]: Start difference. First operand 291 states and 770 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 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,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:45,536 INFO L93 Difference]: Finished difference Result 705 states and 1925 transitions. [2025-04-13 17:06:45,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 17:06:45,537 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 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:45,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:45,539 INFO L225 Difference]: With dead ends: 705 [2025-04-13 17:06:45,539 INFO L226 Difference]: Without dead ends: 563 [2025-04-13 17:06:45,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1806, Invalid=4514, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 17:06:45,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 498 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:45,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-04-13 17:06:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 343. [2025-04-13 17:06:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 2.6666666666666665) internal successors, (912), 342 states have internal predecessors, (912), 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,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 912 transitions. [2025-04-13 17:06:45,555 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 912 transitions. Word has length 44 [2025-04-13 17:06:45,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:45,556 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 912 transitions. [2025-04-13 17:06:45,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 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,556 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 912 transitions. [2025-04-13 17:06:45,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-13 17:06:45,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:45,557 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:45,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:45,761 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:45,761 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:45,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash -198171524, now seen corresponding path program 5 times [2025-04-13 17:06:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:45,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232660556] [2025-04-13 17:06:45,761 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:45,766 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 17 equivalence classes. [2025-04-13 17:06:45,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 17:06:45,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-04-13 17:06:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:06:45,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:06:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-13 17:06:45,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 17:06:45,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:06:45,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:06:45,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:06:45,809 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:45,811 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:45,811 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:45,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:06:45,813 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2025-04-13 17:06:45,883 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:45,884 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:45,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:45 BasicIcfg [2025-04-13 17:06:45,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:45,886 INFO L158 Benchmark]: Toolchain (without parser) took 9492.73ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 106.8MB in the end (delta: 515.5kB). Peak memory consumption was 80.8MB. Max. memory is 8.0GB. [2025-04-13 17:06:45,886 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:45,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.58ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 84.5MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:45,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.87ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:45,887 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:45,887 INFO L158 Benchmark]: RCFGBuilder took 258.51ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 60.7MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:45,887 INFO L158 Benchmark]: TraceAbstraction took 8766.75ms. Allocated memory is still 155.2MB. Free memory was 60.0MB in the beginning and 106.8MB in the end (delta: -46.7MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2025-04-13 17:06:45,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.58ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 84.5MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.87ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 258.51ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 60.7MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8766.75ms. Allocated memory is still 155.2MB. Free memory was 60.0MB in the beginning and 106.8MB in the end (delta: -46.7MB). Peak memory consumption was 34.6MB. 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:50}, \at(argc, Pre)=51, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, 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=9, k=9] [L716] 0 int condI = i >= (2*10 +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=25, id1=-1, id2=0, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +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=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() 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=25, id1=-1, id2=0, j=26, k=9, k=9] - 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: 8.6s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2252 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2252 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3144 IncrementalHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 3 mSDtfsCounter, 3144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 209 SyntacticMatches, 14 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=10, InterpolantAutomatonStates: 241, 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, 714 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 1747 SizeOfPredicates, 56 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 3/1010 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:45,899 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...