/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/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:30:20,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:30:20,689 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 18:30:20,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:30:20,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:30:20,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:30:20,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:30:20,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:30:20,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:30:20,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:30:20,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:30:20,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:30:20,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:30:20,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:30:20,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:30:20,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:30:20,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:30:20,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:30:20,709 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 18:30:20,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:30:20,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:30:20,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:30:20,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:30:20,904 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:30:20,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-13 18:30:22,205 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098ecc7/dace973975304dddafee1b2f41e723c2/FLAGe7908223e [2025-04-13 18:30:22,403 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:30:22,404 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-13 18:30:22,409 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098ecc7/dace973975304dddafee1b2f41e723c2/FLAGe7908223e [2025-04-13 18:30:23,207 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098ecc7/dace973975304dddafee1b2f41e723c2 [2025-04-13 18:30:23,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:30:23,210 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:30:23,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:30:23,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:30:23,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:30:23,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd20f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23, skipping insertion in model container [2025-04-13 18:30:23,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:30:23,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-13 18:30:23,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:30:23,399 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:30:23,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-13 18:30:23,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:30:23,443 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:30:23,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23 WrapperNode [2025-04-13 18:30:23,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:30:23,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:30:23,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:30:23,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:30:23,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,470 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-04-13 18:30:23,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:30:23,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:30:23,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:30:23,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:30:23,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,491 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 18:30:23,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:30:23,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:30:23,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:30:23,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:30:23,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (1/1) ... [2025-04-13 18:30:23,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:30:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:23,535 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 18:30:23,537 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 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:30:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:30:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:30:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:30:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:30:23,552 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 18:30:23,602 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:30:23,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:30:23,719 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:30:23,720 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:30:23,720 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:30:23,831 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:30:23,836 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:30:23,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:30:23 BoogieIcfgContainer [2025-04-13 18:30:23,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:30:23,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:30:23,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:30:23,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:30:23,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:30:23" (1/3) ... [2025-04-13 18:30:23,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565c701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:30:23, skipping insertion in model container [2025-04-13 18:30:23,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:30:23" (2/3) ... [2025-04-13 18:30:23,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565c701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:30:23, skipping insertion in model container [2025-04-13 18:30:23,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:30:23" (3/3) ... [2025-04-13 18:30:23,847 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-13 18:30:23,856 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:30:23,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-nonblocking-counter-alt2.wvr.c that has 3 procedures, 18 locations, 18 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 18:30:23,857 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:30:23,897 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:30:23,916 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 54 flow [2025-04-13 18:30:23,927 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 48 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:23,947 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:30:23,954 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;@74a878ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:30:23,954 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:30:23,955 INFO L278 IsEmpty]: Start isEmpty. Operand has 48 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:23,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 18:30:23,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:23,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:23,959 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 18:30:23,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 899379101, now seen corresponding path program 1 times [2025-04-13 18:30:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:23,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120915686] [2025-04-13 18:30:23,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:24,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:30:24,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:30:24,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:24,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:24,108 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 18:30:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:24,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120915686] [2025-04-13 18:30:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120915686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:30:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410491246] [2025-04-13 18:30:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:24,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:30:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:24,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:30:24,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:30:24,128 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:24,182 INFO L93 Difference]: Finished difference Result 64 states and 142 transitions. [2025-04-13 18:30:24,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:30:24,184 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 18:30:24,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:24,189 INFO L225 Difference]: With dead ends: 64 [2025-04-13 18:30:24,189 INFO L226 Difference]: Without dead ends: 48 [2025-04-13 18:30:24,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:30:24,195 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:24,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:30:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-13 18:30:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-13 18:30:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 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 18:30:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2025-04-13 18:30:24,232 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 108 transitions. Word has length 11 [2025-04-13 18:30:24,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:24,233 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 108 transitions. [2025-04-13 18:30:24,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:24,233 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 108 transitions. [2025-04-13 18:30:24,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:30:24,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:24,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:24,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:30:24,234 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 18:30:24,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1885620354, now seen corresponding path program 1 times [2025-04-13 18:30:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:24,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710443171] [2025-04-13 18:30:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:24,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:30:24,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:30:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:24,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:24,432 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 18:30:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:24,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710443171] [2025-04-13 18:30:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710443171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:30:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45851825] [2025-04-13 18:30:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:24,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:30:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:24,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:30:24,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:30:24,436 INFO L87 Difference]: Start difference. First operand 48 states and 108 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 18:30:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:24,488 INFO L93 Difference]: Finished difference Result 77 states and 176 transitions. [2025-04-13 18:30:24,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:30:24,488 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-04-13 18:30:24,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:24,489 INFO L225 Difference]: With dead ends: 77 [2025-04-13 18:30:24,489 INFO L226 Difference]: Without dead ends: 66 [2025-04-13 18:30:24,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:30:24,490 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:24,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:30:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-13 18:30:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-04-13 18:30:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 56 states have internal predecessors, (130), 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 18:30:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 130 transitions. [2025-04-13 18:30:24,499 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 130 transitions. Word has length 13 [2025-04-13 18:30:24,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:24,500 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 130 transitions. [2025-04-13 18:30:24,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 18:30:24,500 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 130 transitions. [2025-04-13 18:30:24,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:30:24,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:24,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:24,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:30:24,502 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 18:30:24,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1301266080, now seen corresponding path program 1 times [2025-04-13 18:30:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:24,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222146353] [2025-04-13 18:30:24,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:24,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:30:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:24,809 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 18:30:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:24,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222146353] [2025-04-13 18:30:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222146353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:24,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440698961] [2025-04-13 18:30:24,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:24,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:24,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:24,813 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 18:30:24,827 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 18:30:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:30:24,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:24,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:24,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:24,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:30:24,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:25,039 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 18:30:25,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:25,288 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 18:30:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440698961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:25,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 18:30:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523503272] [2025-04-13 18:30:25,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:25,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:30:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:25,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:30:25,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:30:25,290 INFO L87 Difference]: Start difference. First operand 57 states and 130 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:25,685 INFO L93 Difference]: Finished difference Result 287 states and 680 transitions. [2025-04-13 18:30:25,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:30:25,685 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:30:25,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:25,691 INFO L225 Difference]: With dead ends: 287 [2025-04-13 18:30:25,691 INFO L226 Difference]: Without dead ends: 246 [2025-04-13 18:30:25,691 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:30:25,692 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:25,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:30:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-13 18:30:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 112. [2025-04-13 18:30:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.5225225225225225) internal successors, (280), 111 states have internal predecessors, (280), 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 18:30:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 280 transitions. [2025-04-13 18:30:25,718 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 280 transitions. Word has length 15 [2025-04-13 18:30:25,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:25,719 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 280 transitions. [2025-04-13 18:30:25,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:25,719 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 280 transitions. [2025-04-13 18:30:25,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:30:25,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:25,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:25,726 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 18:30:25,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:25,921 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 18:30:25,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1229237144, now seen corresponding path program 2 times [2025-04-13 18:30:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:25,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507897678] [2025-04-13 18:30:25,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:25,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:25,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:25,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,092 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 18:30:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:26,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507897678] [2025-04-13 18:30:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507897678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:26,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957908505] [2025-04-13 18:30:26,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:26,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:26,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:26,094 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 18:30:26,098 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 18:30:26,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:26,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:26,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:26,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:30:26,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:26,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957908505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:26,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:26,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-04-13 18:30:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037675304] [2025-04-13 18:30:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:26,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:30:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:26,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:30:26,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:30:26,217 INFO L87 Difference]: Start difference. First operand 112 states and 280 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18:30:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:26,277 INFO L93 Difference]: Finished difference Result 129 states and 312 transitions. [2025-04-13 18:30:26,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:30:26,277 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:30:26,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:26,278 INFO L225 Difference]: With dead ends: 129 [2025-04-13 18:30:26,278 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 18:30:26,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:30:26,279 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:26,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:30:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 18:30:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-04-13 18:30:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.5213675213675213) internal successors, (295), 117 states have internal predecessors, (295), 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 18:30:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 295 transitions. [2025-04-13 18:30:26,301 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 295 transitions. Word has length 15 [2025-04-13 18:30:26,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:26,301 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 295 transitions. [2025-04-13 18:30:26,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18:30:26,301 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 295 transitions. [2025-04-13 18:30:26,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:30:26,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:26,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:26,309 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 18:30:26,502 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,SelfDestructingSolverStorable3 [2025-04-13 18:30:26,503 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 18:30:26,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1950772816, now seen corresponding path program 3 times [2025-04-13 18:30:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:26,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982558640] [2025-04-13 18:30:26,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:26,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:26,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:26,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,671 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 18:30:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:26,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982558640] [2025-04-13 18:30:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982558640] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:26,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195904355] [2025-04-13 18:30:26,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:26,675 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 18:30:26,677 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 18:30:26,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:26,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:26,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:26,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:30:26,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:26,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195904355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-04-13 18:30:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075265115] [2025-04-13 18:30:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:26,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:30:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:30:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:30:26,809 INFO L87 Difference]: Start difference. First operand 118 states and 295 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18:30:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:26,890 INFO L93 Difference]: Finished difference Result 135 states and 329 transitions. [2025-04-13 18:30:26,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:30:26,891 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:30:26,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:26,892 INFO L225 Difference]: With dead ends: 135 [2025-04-13 18:30:26,892 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 18:30:26,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:30:26,892 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:26,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 18:30:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-04-13 18:30:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.53781512605042) internal successors, (302), 119 states have internal predecessors, (302), 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 18:30:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 302 transitions. [2025-04-13 18:30:26,903 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 302 transitions. Word has length 15 [2025-04-13 18:30:26,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:26,903 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 302 transitions. [2025-04-13 18:30:26,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18:30:26,903 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 302 transitions. [2025-04-13 18:30:26,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:30:26,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:26,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:26,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:27,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:27,108 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 18:30:27,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1948091626, now seen corresponding path program 4 times [2025-04-13 18:30:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:27,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123907075] [2025-04-13 18:30:27,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:27,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:27,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:27,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:27,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:27,185 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 18:30:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:27,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123907075] [2025-04-13 18:30:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123907075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:27,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956099326] [2025-04-13 18:30:27,185 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:27,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:27,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:27,187 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 18:30:27,189 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 18:30:27,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:30:27,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:30:27,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:27,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:27,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:30:27,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:27,277 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 18:30:27,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956099326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-04-13 18:30:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58120765] [2025-04-13 18:30:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:27,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:30:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:27,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:30:27,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:30:27,278 INFO L87 Difference]: Start difference. First operand 120 states and 302 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18:30:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:27,369 INFO L93 Difference]: Finished difference Result 158 states and 392 transitions. [2025-04-13 18:30:27,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:30:27,369 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:30:27,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:27,371 INFO L225 Difference]: With dead ends: 158 [2025-04-13 18:30:27,371 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 18:30:27,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:30:27,373 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:27,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 18:30:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 99. [2025-04-13 18:30:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.4693877551020407) internal successors, (242), 98 states have internal predecessors, (242), 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 18:30:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2025-04-13 18:30:27,387 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 15 [2025-04-13 18:30:27,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:27,387 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2025-04-13 18:30:27,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18:30:27,387 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2025-04-13 18:30:27,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:27,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:27,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:27,395 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 18:30:27,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:27,590 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 18:30:27,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1669911039, now seen corresponding path program 1 times [2025-04-13 18:30:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:27,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523308512] [2025-04-13 18:30:27,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:30:27,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:27,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:27,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:27,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523308512] [2025-04-13 18:30:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523308512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:27,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955106073] [2025-04-13 18:30:27,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:30:27,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:27,740 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 18:30:27,741 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 18:30:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:30:27,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:27,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:27,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:30:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:27,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955106073] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:27,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 18:30:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273853517] [2025-04-13 18:30:27,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:27,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:30:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:27,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:30:27,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:30:27,975 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 18:30:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:28,340 INFO L93 Difference]: Finished difference Result 184 states and 457 transitions. [2025-04-13 18:30:28,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:30:28,341 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 17 [2025-04-13 18:30:28,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:28,342 INFO L225 Difference]: With dead ends: 184 [2025-04-13 18:30:28,342 INFO L226 Difference]: Without dead ends: 171 [2025-04-13 18:30:28,342 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:30:28,343 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 100 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:28,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 10 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:30:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-04-13 18:30:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. [2025-04-13 18:30:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 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 18:30:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 293 transitions. [2025-04-13 18:30:28,368 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 293 transitions. Word has length 17 [2025-04-13 18:30:28,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:28,368 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 293 transitions. [2025-04-13 18:30:28,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 18:30:28,368 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 293 transitions. [2025-04-13 18:30:28,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:28,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:28,369 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:28,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:28,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:28,570 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 18:30:28,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 642162463, now seen corresponding path program 2 times [2025-04-13 18:30:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:28,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428112641] [2025-04-13 18:30:28,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:28,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:28,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:28,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:28,690 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 18:30:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:28,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428112641] [2025-04-13 18:30:28,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428112641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:28,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674512605] [2025-04-13 18:30:28,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:28,692 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 18:30:28,694 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 18:30:28,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:28,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:28,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:28,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:28,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:30:28,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:28,827 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 18:30:28,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:28,980 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 18:30:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674512605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:28,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:28,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 18:30:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225047573] [2025-04-13 18:30:28,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:28,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:30:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:28,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:30:28,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:30:28,981 INFO L87 Difference]: Start difference. First operand 118 states and 293 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:29,207 INFO L93 Difference]: Finished difference Result 216 states and 552 transitions. [2025-04-13 18:30:29,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:30:29,208 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:29,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:29,210 INFO L225 Difference]: With dead ends: 216 [2025-04-13 18:30:29,210 INFO L226 Difference]: Without dead ends: 203 [2025-04-13 18:30:29,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:30:29,210 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:29,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 19 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-13 18:30:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2025-04-13 18:30:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.662857142857143) internal successors, (466), 175 states have internal predecessors, (466), 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 18:30:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 466 transitions. [2025-04-13 18:30:29,250 INFO L79 Accepts]: Start accepts. Automaton has 176 states and 466 transitions. Word has length 17 [2025-04-13 18:30:29,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:29,250 INFO L485 AbstractCegarLoop]: Abstraction has 176 states and 466 transitions. [2025-04-13 18:30:29,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:29,250 INFO L278 IsEmpty]: Start isEmpty. Operand 176 states and 466 transitions. [2025-04-13 18:30:29,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:29,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:29,251 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:29,257 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 18:30:29,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:29,451 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 18:30:29,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1901160951, now seen corresponding path program 3 times [2025-04-13 18:30:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:29,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566391908] [2025-04-13 18:30:29,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:29,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:29,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:29,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:29,554 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 18:30:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:29,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566391908] [2025-04-13 18:30:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566391908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:29,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654201624] [2025-04-13 18:30:29,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:29,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:29,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:29,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:30:29,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:29,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:29,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:29,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:30:29,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:29,672 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 18:30:29,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:29,800 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 18:30:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654201624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:29,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 18:30:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699923831] [2025-04-13 18:30:29,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:29,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:30:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:29,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:30:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:30:29,803 INFO L87 Difference]: Start difference. First operand 176 states and 466 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 18:30:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:30,111 INFO L93 Difference]: Finished difference Result 250 states and 626 transitions. [2025-04-13 18:30:30,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:30:30,111 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 17 [2025-04-13 18:30:30,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:30,112 INFO L225 Difference]: With dead ends: 250 [2025-04-13 18:30:30,112 INFO L226 Difference]: Without dead ends: 241 [2025-04-13 18:30:30,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:30:30,113 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:30,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-13 18:30:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 170. [2025-04-13 18:30:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.5976331360946747) internal successors, (439), 169 states have internal predecessors, (439), 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 18:30:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 439 transitions. [2025-04-13 18:30:30,133 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 439 transitions. Word has length 17 [2025-04-13 18:30:30,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:30,133 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 439 transitions. [2025-04-13 18:30:30,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 18:30:30,133 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 439 transitions. [2025-04-13 18:30:30,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:30,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:30,134 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:30,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:30:30,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:30,338 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 18:30:30,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash -739817313, now seen corresponding path program 4 times [2025-04-13 18:30:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:30,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216331473] [2025-04-13 18:30:30,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:30,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:30,345 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:30,345 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:30,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:30,432 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 18:30:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:30,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216331473] [2025-04-13 18:30:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216331473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:30:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101054762] [2025-04-13 18:30:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:30,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:30:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:30,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:30:30,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:30:30,433 INFO L87 Difference]: Start difference. First operand 170 states and 439 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:30,520 INFO L93 Difference]: Finished difference Result 201 states and 520 transitions. [2025-04-13 18:30:30,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:30:30,521 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:30,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:30,522 INFO L225 Difference]: With dead ends: 201 [2025-04-13 18:30:30,522 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 18:30:30,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:30:30,522 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:30,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 18:30:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2025-04-13 18:30:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.633879781420765) internal successors, (482), 183 states have internal predecessors, (482), 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 18:30:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 482 transitions. [2025-04-13 18:30:30,545 INFO L79 Accepts]: Start accepts. Automaton has 184 states and 482 transitions. Word has length 17 [2025-04-13 18:30:30,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:30,545 INFO L485 AbstractCegarLoop]: Abstraction has 184 states and 482 transitions. [2025-04-13 18:30:30,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:30,545 INFO L278 IsEmpty]: Start isEmpty. Operand 184 states and 482 transitions. [2025-04-13 18:30:30,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:30,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:30,545 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:30,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:30:30,546 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 18:30:30,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -881026653, now seen corresponding path program 5 times [2025-04-13 18:30:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:30,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461476829] [2025-04-13 18:30:30,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:30,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:30:30,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:30,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:30:30,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:30,677 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 18:30:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:30,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461476829] [2025-04-13 18:30:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461476829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:30:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241346061] [2025-04-13 18:30:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:30,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:30:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:30,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:30:30,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:30:30,678 INFO L87 Difference]: Start difference. First operand 184 states and 482 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:30,781 INFO L93 Difference]: Finished difference Result 228 states and 587 transitions. [2025-04-13 18:30:30,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:30:30,782 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:30,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:30,783 INFO L225 Difference]: With dead ends: 228 [2025-04-13 18:30:30,783 INFO L226 Difference]: Without dead ends: 223 [2025-04-13 18:30:30,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:30:30,784 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:30,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-13 18:30:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2025-04-13 18:30:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.615819209039548) internal successors, (463), 177 states have internal predecessors, (463), 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 18:30:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 463 transitions. [2025-04-13 18:30:30,805 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 463 transitions. Word has length 17 [2025-04-13 18:30:30,805 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:30,805 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 463 transitions. [2025-04-13 18:30:30,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:30,805 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 463 transitions. [2025-04-13 18:30:30,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:30,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:30,806 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:30,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:30:30,806 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:30,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1850129057, now seen corresponding path program 6 times [2025-04-13 18:30:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:30,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259480542] [2025-04-13 18:30:30,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:30,809 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:30,814 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:30,814 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:30,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:30,916 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 18:30:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:30,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259480542] [2025-04-13 18:30:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259480542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:30,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120550113] [2025-04-13 18:30:30,916 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:30,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:30,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:30:30,941 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:30,950 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:30,950 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:30,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:30:30,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:31,045 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 18:30:31,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:31,132 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 18:30:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120550113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:31,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-04-13 18:30:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849374541] [2025-04-13 18:30:31,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:31,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:30:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:31,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:30:31,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:30:31,133 INFO L87 Difference]: Start difference. First operand 178 states and 463 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 18:30:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:31,629 INFO L93 Difference]: Finished difference Result 333 states and 885 transitions. [2025-04-13 18:30:31,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:30:31,629 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 17 [2025-04-13 18:30:31,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:31,631 INFO L225 Difference]: With dead ends: 333 [2025-04-13 18:30:31,631 INFO L226 Difference]: Without dead ends: 320 [2025-04-13 18:30:31,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:30:31,632 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 113 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:31,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 10 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:30:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-04-13 18:30:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 190. [2025-04-13 18:30:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.6507936507936507) internal successors, (501), 189 states have internal predecessors, (501), 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 18:30:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 501 transitions. [2025-04-13 18:30:31,668 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 501 transitions. Word has length 17 [2025-04-13 18:30:31,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:31,669 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 501 transitions. [2025-04-13 18:30:31,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 18:30:31,669 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 501 transitions. [2025-04-13 18:30:31,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:31,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:31,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:31,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:31,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 18:30:31,870 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:31,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1771450561, now seen corresponding path program 7 times [2025-04-13 18:30:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:31,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9738438] [2025-04-13 18:30:31,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:31,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:30:31,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:31,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:31,947 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 18:30:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:31,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9738438] [2025-04-13 18:30:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9738438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:31,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:31,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:30:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123682] [2025-04-13 18:30:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:31,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:30:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:31,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:30:31,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:30:31,948 INFO L87 Difference]: Start difference. First operand 190 states and 501 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:32,046 INFO L93 Difference]: Finished difference Result 269 states and 690 transitions. [2025-04-13 18:30:32,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:30:32,046 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:32,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:32,048 INFO L225 Difference]: With dead ends: 269 [2025-04-13 18:30:32,048 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 18:30:32,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:30:32,048 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:32,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:30:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 18:30:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2025-04-13 18:30:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.6403940886699506) internal successors, (536), 203 states have internal predecessors, (536), 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 18:30:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 536 transitions. [2025-04-13 18:30:32,074 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 536 transitions. Word has length 17 [2025-04-13 18:30:32,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:32,074 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 536 transitions. [2025-04-13 18:30:32,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,074 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 536 transitions. [2025-04-13 18:30:32,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:32,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:32,075 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:32,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:30:32,075 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:32,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1664047559, now seen corresponding path program 8 times [2025-04-13 18:30:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:32,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858796178] [2025-04-13 18:30:32,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:32,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:30:32,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:32,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:30:32,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:32,164 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 18:30:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:32,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858796178] [2025-04-13 18:30:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858796178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:30:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068691226] [2025-04-13 18:30:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:32,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:30:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:32,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:30:32,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:30:32,165 INFO L87 Difference]: Start difference. First operand 204 states and 536 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:32,297 INFO L93 Difference]: Finished difference Result 287 states and 751 transitions. [2025-04-13 18:30:32,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:30:32,297 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:32,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:32,299 INFO L225 Difference]: With dead ends: 287 [2025-04-13 18:30:32,299 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 18:30:32,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:30:32,299 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:32,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 18:30:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2025-04-13 18:30:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.6473429951690823) internal successors, (548), 207 states have internal predecessors, (548), 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 18:30:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 548 transitions. [2025-04-13 18:30:32,327 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 548 transitions. Word has length 17 [2025-04-13 18:30:32,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:32,327 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 548 transitions. [2025-04-13 18:30:32,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,327 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 548 transitions. [2025-04-13 18:30:32,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:32,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:32,328 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:32,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:30:32,328 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:32,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1805256899, now seen corresponding path program 9 times [2025-04-13 18:30:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:32,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302614598] [2025-04-13 18:30:32,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:32,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:32,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:32,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:32,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:32,450 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 18:30:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:32,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302614598] [2025-04-13 18:30:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302614598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:30:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:30:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672131147] [2025-04-13 18:30:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:32,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:30:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:30:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:30:32,451 INFO L87 Difference]: Start difference. First operand 208 states and 548 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:32,553 INFO L93 Difference]: Finished difference Result 306 states and 790 transitions. [2025-04-13 18:30:32,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:30:32,553 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:32,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:32,554 INFO L225 Difference]: With dead ends: 306 [2025-04-13 18:30:32,554 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 18:30:32,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:30:32,555 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:32,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:30:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 18:30:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 204. [2025-04-13 18:30:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.6403940886699506) internal successors, (536), 203 states have internal predecessors, (536), 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 18:30:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 536 transitions. [2025-04-13 18:30:32,582 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 536 transitions. Word has length 17 [2025-04-13 18:30:32,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:32,582 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 536 transitions. [2025-04-13 18:30:32,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:32,582 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 536 transitions. [2025-04-13 18:30:32,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:30:32,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:32,583 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:32,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:30:32,583 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:32,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1645613533, now seen corresponding path program 10 times [2025-04-13 18:30:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:32,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131352968] [2025-04-13 18:30:32,583 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:32,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:32,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:32,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:32,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:32,682 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 18:30:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:32,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131352968] [2025-04-13 18:30:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131352968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:32,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911381297] [2025-04-13 18:30:32,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:32,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:30:32,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:30:32,720 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:30:32,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:32,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:32,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:30:32,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:32,790 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 18:30:32,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:32,920 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 18:30:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911381297] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:32,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:30:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 15 [2025-04-13 18:30:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283850446] [2025-04-13 18:30:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:32,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:30:32,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:32,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:30:32,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:30:32,921 INFO L87 Difference]: Start difference. First operand 204 states and 536 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:33,160 INFO L93 Difference]: Finished difference Result 317 states and 833 transitions. [2025-04-13 18:30:33,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:30:33,161 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:30:33,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:33,162 INFO L225 Difference]: With dead ends: 317 [2025-04-13 18:30:33,162 INFO L226 Difference]: Without dead ends: 308 [2025-04-13 18:30:33,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:30:33,163 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:33,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-04-13 18:30:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 204. [2025-04-13 18:30:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.6403940886699506) internal successors, (536), 203 states have internal predecessors, (536), 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 18:30:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 536 transitions. [2025-04-13 18:30:33,191 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 536 transitions. Word has length 17 [2025-04-13 18:30:33,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:33,191 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 536 transitions. [2025-04-13 18:30:33,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:33,191 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 536 transitions. [2025-04-13 18:30:33,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:33,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:33,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:33,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:30:33,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:30:33,392 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:33,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 147317347, now seen corresponding path program 11 times [2025-04-13 18:30:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:33,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851803932] [2025-04-13 18:30:33,393 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:33,395 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:30:33,405 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:33,405 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:30:33,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:33,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851803932] [2025-04-13 18:30:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851803932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:33,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992052003] [2025-04-13 18:30:33,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:33,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:33,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:30:33,578 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:30:33,591 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:33,591 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:30:33,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:33,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:30:33,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:33,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992052003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:33,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2025-04-13 18:30:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359543076] [2025-04-13 18:30:33,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:33,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:30:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:30:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:30:33,989 INFO L87 Difference]: Start difference. First operand 204 states and 536 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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 18:30:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:34,618 INFO L93 Difference]: Finished difference Result 555 states and 1409 transitions. [2025-04-13 18:30:34,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:30:34,618 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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 19 [2025-04-13 18:30:34,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:34,621 INFO L225 Difference]: With dead ends: 555 [2025-04-13 18:30:34,621 INFO L226 Difference]: Without dead ends: 465 [2025-04-13 18:30:34,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:30:34,623 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 98 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:34,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 10 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:30:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-04-13 18:30:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 279. [2025-04-13 18:30:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.6258992805755397) internal successors, (730), 278 states have internal predecessors, (730), 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 18:30:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 730 transitions. [2025-04-13 18:30:34,679 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 730 transitions. Word has length 19 [2025-04-13 18:30:34,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:34,680 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 730 transitions. [2025-04-13 18:30:34,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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 18:30:34,680 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 730 transitions. [2025-04-13 18:30:34,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:34,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:34,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:34,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:34,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 18:30:34,881 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:34,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash 885875381, now seen corresponding path program 12 times [2025-04-13 18:30:34,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:34,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627001817] [2025-04-13 18:30:34,882 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:34,884 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:34,889 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:34,889 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:34,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:35,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:35,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627001817] [2025-04-13 18:30:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627001817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:35,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944293170] [2025-04-13 18:30:35,091 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:35,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:35,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 18:30:35,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:35,131 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:35,131 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:35,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:30:35,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:30:35,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:35,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944293170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:35,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:35,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-04-13 18:30:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512343606] [2025-04-13 18:30:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:35,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:30:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:35,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:30:35,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:30:35,264 INFO L87 Difference]: Start difference. First operand 279 states and 730 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:35,411 INFO L93 Difference]: Finished difference Result 302 states and 777 transitions. [2025-04-13 18:30:35,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:30:35,412 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:30:35,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:35,414 INFO L225 Difference]: With dead ends: 302 [2025-04-13 18:30:35,414 INFO L226 Difference]: Without dead ends: 291 [2025-04-13 18:30:35,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:30:35,414 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:35,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-13 18:30:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2025-04-13 18:30:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.625) internal successors, (735), 280 states have internal predecessors, (735), 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 18:30:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 735 transitions. [2025-04-13 18:30:35,477 INFO L79 Accepts]: Start accepts. Automaton has 281 states and 735 transitions. Word has length 19 [2025-04-13 18:30:35,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:35,478 INFO L485 AbstractCegarLoop]: Abstraction has 281 states and 735 transitions. [2025-04-13 18:30:35,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:35,478 INFO L278 IsEmpty]: Start isEmpty. Operand 281 states and 735 transitions. [2025-04-13 18:30:35,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:35,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:35,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:35,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:30:35,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:30:35,683 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:35,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1745344557, now seen corresponding path program 13 times [2025-04-13 18:30:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:35,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228543853] [2025-04-13 18:30:35,684 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:35,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:30:35,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:35,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:35,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:35,798 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 18:30:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:35,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228543853] [2025-04-13 18:30:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228543853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:35,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069322499] [2025-04-13 18:30:35,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:35,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:35,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:35,800 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:35,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 18:30:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:30:35,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:35,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:35,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:35,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:30:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:35,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069322499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 11 [2025-04-13 18:30:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449454224] [2025-04-13 18:30:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:35,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:30:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:35,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:30:35,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:30:35,958 INFO L87 Difference]: Start difference. First operand 281 states and 735 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 18:30:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:36,126 INFO L93 Difference]: Finished difference Result 312 states and 804 transitions. [2025-04-13 18:30:36,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:30:36,126 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2025-04-13 18:30:36,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:36,128 INFO L225 Difference]: With dead ends: 312 [2025-04-13 18:30:36,128 INFO L226 Difference]: Without dead ends: 303 [2025-04-13 18:30:36,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:30:36,128 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:36,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-13 18:30:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 283. [2025-04-13 18:30:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 2.624113475177305) internal successors, (740), 282 states have internal predecessors, (740), 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 18:30:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 740 transitions. [2025-04-13 18:30:36,178 INFO L79 Accepts]: Start accepts. Automaton has 283 states and 740 transitions. Word has length 19 [2025-04-13 18:30:36,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:36,178 INFO L485 AbstractCegarLoop]: Abstraction has 283 states and 740 transitions. [2025-04-13 18:30:36,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 18:30:36,178 INFO L278 IsEmpty]: Start isEmpty. Operand 283 states and 740 transitions. [2025-04-13 18:30:36,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:36,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:36,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:36,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:36,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:36,379 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:36,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1606816407, now seen corresponding path program 14 times [2025-04-13 18:30:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:36,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96549112] [2025-04-13 18:30:36,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:36,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:36,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:36,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:36,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96549112] [2025-04-13 18:30:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96549112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:36,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283191561] [2025-04-13 18:30:36,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:36,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:36,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:36,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 18:30:36,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:36,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:36,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:36,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:30:36,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:30:36,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283191561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:37,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 22 [2025-04-13 18:30:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611216780] [2025-04-13 18:30:37,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:37,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:30:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:30:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:30:37,450 INFO L87 Difference]: Start difference. First operand 283 states and 740 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 18:30:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:40,343 INFO L93 Difference]: Finished difference Result 706 states and 1912 transitions. [2025-04-13 18:30:40,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:30:40,344 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 19 [2025-04-13 18:30:40,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:40,347 INFO L225 Difference]: With dead ends: 706 [2025-04-13 18:30:40,347 INFO L226 Difference]: Without dead ends: 689 [2025-04-13 18:30:40,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:30:40,347 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:40,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 3 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:30:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-04-13 18:30:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 479. [2025-04-13 18:30:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 2.8200836820083683) internal successors, (1348), 478 states have internal predecessors, (1348), 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 18:30:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1348 transitions. [2025-04-13 18:30:40,459 INFO L79 Accepts]: Start accepts. Automaton has 479 states and 1348 transitions. Word has length 19 [2025-04-13 18:30:40,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:40,459 INFO L485 AbstractCegarLoop]: Abstraction has 479 states and 1348 transitions. [2025-04-13 18:30:40,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 18:30:40,459 INFO L278 IsEmpty]: Start isEmpty. Operand 479 states and 1348 transitions. [2025-04-13 18:30:40,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:40,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:40,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:40,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:40,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-13 18:30:40,661 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:40,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 242333667, now seen corresponding path program 15 times [2025-04-13 18:30:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:40,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736789645] [2025-04-13 18:30:40,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:40,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:40,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:40,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:40,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:40,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736789645] [2025-04-13 18:30:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736789645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:40,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589885895] [2025-04-13 18:30:40,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:40,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:40,817 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:40,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 18:30:40,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:40,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:40,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:40,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:40,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:30:40,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:40,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589885895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:41,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 18:30:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543492950] [2025-04-13 18:30:41,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:41,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:30:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:41,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:30:41,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:30:41,122 INFO L87 Difference]: Start difference. First operand 479 states and 1348 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 18:30:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:41,612 INFO L93 Difference]: Finished difference Result 710 states and 1986 transitions. [2025-04-13 18:30:41,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:30:41,613 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 19 [2025-04-13 18:30:41,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:41,616 INFO L225 Difference]: With dead ends: 710 [2025-04-13 18:30:41,616 INFO L226 Difference]: Without dead ends: 697 [2025-04-13 18:30:41,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:30:41,617 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:41,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 12 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:30:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-04-13 18:30:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 551. [2025-04-13 18:30:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 2.8654545454545453) internal successors, (1576), 550 states have internal predecessors, (1576), 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 18:30:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1576 transitions. [2025-04-13 18:30:41,749 INFO L79 Accepts]: Start accepts. Automaton has 551 states and 1576 transitions. Word has length 19 [2025-04-13 18:30:41,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:41,750 INFO L485 AbstractCegarLoop]: Abstraction has 551 states and 1576 transitions. [2025-04-13 18:30:41,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 18:30:41,750 INFO L278 IsEmpty]: Start isEmpty. Operand 551 states and 1576 transitions. [2025-04-13 18:30:41,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:41,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:41,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:41,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:41,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:41,951 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:41,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1101802843, now seen corresponding path program 16 times [2025-04-13 18:30:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:41,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799948346] [2025-04-13 18:30:41,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:41,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:41,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:41,958 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:41,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:42,054 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 18:30:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:42,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799948346] [2025-04-13 18:30:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799948346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:42,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127180617] [2025-04-13 18:30:42,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:42,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:42,057 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:42,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 18:30:42,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:42,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:42,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:42,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:30:42,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:42,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:30:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127180617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:30:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:30:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2025-04-13 18:30:42,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862311123] [2025-04-13 18:30:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:30:42,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:30:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:42,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:30:42,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:30:42,236 INFO L87 Difference]: Start difference. First operand 551 states and 1576 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 18:30:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:42,516 INFO L93 Difference]: Finished difference Result 568 states and 1606 transitions. [2025-04-13 18:30:42,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:30:42,516 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2025-04-13 18:30:42,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:42,518 INFO L225 Difference]: With dead ends: 568 [2025-04-13 18:30:42,519 INFO L226 Difference]: Without dead ends: 559 [2025-04-13 18:30:42,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:30:42,520 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:42,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:30:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-04-13 18:30:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 551. [2025-04-13 18:30:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 2.861818181818182) internal successors, (1574), 550 states have internal predecessors, (1574), 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 18:30:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1574 transitions. [2025-04-13 18:30:42,648 INFO L79 Accepts]: Start accepts. Automaton has 551 states and 1574 transitions. Word has length 19 [2025-04-13 18:30:42,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:42,648 INFO L485 AbstractCegarLoop]: Abstraction has 551 states and 1574 transitions. [2025-04-13 18:30:42,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 18:30:42,648 INFO L278 IsEmpty]: Start isEmpty. Operand 551 states and 1574 transitions. [2025-04-13 18:30:42,649 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:30:42,649 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:42,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:42,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:30:42,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:42,850 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:42,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 963274693, now seen corresponding path program 17 times [2025-04-13 18:30:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:42,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634960626] [2025-04-13 18:30:42,850 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:42,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:42,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:42,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:42,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:42,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634960626] [2025-04-13 18:30:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634960626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:42,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208886003] [2025-04-13 18:30:42,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:42,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:42,988 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 18:30:43,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:30:43,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:30:43,017 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:43,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:43,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:30:43,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:43,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208886003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:43,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2025-04-13 18:30:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484173761] [2025-04-13 18:30:43,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:43,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:30:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:43,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:30:43,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:30:43,386 INFO L87 Difference]: Start difference. First operand 551 states and 1574 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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 18:30:47,687 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:30:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:47,960 INFO L93 Difference]: Finished difference Result 828 states and 2259 transitions. [2025-04-13 18:30:47,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:30:47,961 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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 19 [2025-04-13 18:30:47,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:47,964 INFO L225 Difference]: With dead ends: 828 [2025-04-13 18:30:47,964 INFO L226 Difference]: Without dead ends: 798 [2025-04-13 18:30:47,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:30:47,964 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:47,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 10 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 18:30:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-04-13 18:30:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 483. [2025-04-13 18:30:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 2.8174273858921164) internal successors, (1358), 482 states have internal predecessors, (1358), 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 18:30:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1358 transitions. [2025-04-13 18:30:48,094 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 1358 transitions. Word has length 19 [2025-04-13 18:30:48,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:48,094 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 1358 transitions. [2025-04-13 18:30:48,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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 18:30:48,094 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 1358 transitions. [2025-04-13 18:30:48,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:30:48,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:48,095 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:48,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:48,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 18:30:48,296 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:48,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 987040188, now seen corresponding path program 18 times [2025-04-13 18:30:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:48,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950199521] [2025-04-13 18:30:48,296 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:48,298 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:30:48,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:30:48,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:30:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:48,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950199521] [2025-04-13 18:30:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950199521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:48,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649971188] [2025-04-13 18:30:48,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:48,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:48,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:48,480 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:48,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 18:30:48,503 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:30:48,513 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:30:48,513 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:30:48,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:48,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:30:48,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:48,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649971188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:48,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-13 18:30:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990364713] [2025-04-13 18:30:48,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:48,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:30:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:48,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:30:48,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:30:48,965 INFO L87 Difference]: Start difference. First operand 483 states and 1358 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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 18:30:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:50,509 INFO L93 Difference]: Finished difference Result 838 states and 2325 transitions. [2025-04-13 18:30:50,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 18:30:50,509 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:30:50,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:50,512 INFO L225 Difference]: With dead ends: 838 [2025-04-13 18:30:50,512 INFO L226 Difference]: Without dead ends: 813 [2025-04-13 18:30:50,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=2101, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:30:50,513 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 265 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:50,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 18 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:30:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-04-13 18:30:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 523. [2025-04-13 18:30:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 2.814176245210728) internal successors, (1469), 522 states have internal predecessors, (1469), 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 18:30:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1469 transitions. [2025-04-13 18:30:50,660 INFO L79 Accepts]: Start accepts. Automaton has 523 states and 1469 transitions. Word has length 21 [2025-04-13 18:30:50,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:50,660 INFO L485 AbstractCegarLoop]: Abstraction has 523 states and 1469 transitions. [2025-04-13 18:30:50,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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 18:30:50,660 INFO L278 IsEmpty]: Start isEmpty. Operand 523 states and 1469 transitions. [2025-04-13 18:30:50,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:30:50,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:50,661 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:50,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:50,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:50,862 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:30:50,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash -201007582, now seen corresponding path program 19 times [2025-04-13 18:30:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:50,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403384880] [2025-04-13 18:30:50,862 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:30:50,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:30:50,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:51,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403384880] [2025-04-13 18:30:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403384880] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:51,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784164754] [2025-04-13 18:30:51,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:51,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:51,015 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 18:30:51,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:30:51,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:30:51,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:51,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:51,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:30:51,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:51,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784164754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:52,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:52,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-04-13 18:30:52,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899807358] [2025-04-13 18:30:52,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:52,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:30:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:52,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:30:52,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:30:52,090 INFO L87 Difference]: Start difference. First operand 523 states and 1469 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 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 18:30:56,966 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse10 (+ c_thread1Thread1of1ForFork0_~i~0 1)) (.cse12 (mod c_~counter~0 4294967296))) (let ((.cse7 (< .cse12 1)) (.cse6 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse0 (mod c_~M~0 4294967296)) (.cse2 (mod .cse10 4294967296)) (.cse3 (mod .cse11 4294967296))) (and (<= 1 .cse0) (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse1 (* v_y_120 4294967296))) (or (not (= (+ (* 4294967295 v_z_120) .cse1) 2)) (< 4294967295 (+ v_z_120 .cse2)) (< (+ (* v_z_120 4294967296) .cse2 .cse1) 4294967296)))) (or (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse5 (* v_y_120 4294967296))) (let ((.cse4 (+ (* 4294967295 v_z_120) .cse5))) (or (< .cse3 .cse4) (< 4294967295 (+ v_z_120 .cse2)) (< (+ (* v_z_120 4294967296) .cse2 .cse5) 4294967296) (< .cse4 (+ .cse6 1)))))) .cse7) (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse9 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse8 (* v_y_120 4294967296))) (or (not (= (+ (* 4294967295 v_z_120) .cse8) 2)) (< 4294967295 (+ .cse9 v_z_120)) (< (+ .cse9 (* v_z_120 4294967296) .cse8) 4294967296)))) (or (and (<= c_thread1Thread1of1ForFork0_~i~0 1) (<= 0 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (<= c_thread2Thread1of1ForFork1_~i~1 c_thread1Thread1of1ForFork0_~i~0)) (= .cse10 c_thread2Thread1of1ForFork1_~i~1) (and (<= 0 c_thread2Thread1of1ForFork1_~i~1) (<= .cse11 .cse0))) (or (and (or (< .cse3 .cse0) .cse7) (or (< 0 .cse12) (< .cse6 .cse0))) (< (+ .cse0 (mod (+ (* 4294967295 c_~M~0) c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) 4294967296)) (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse13 (* v_y_120 4294967296))) (let ((.cse14 (+ (* 4294967295 v_z_120) .cse13))) (or (< 4294967295 (+ v_z_120 .cse2)) (< (+ (* v_z_120 4294967296) .cse2 .cse13) 4294967296) (< .cse14 (+ .cse3 1)) (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse14)))))))) is different from false [2025-04-13 18:31:53,788 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:31:58,481 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:01,668 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:05,671 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:09,689 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:22,920 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:27,340 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:31,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:35,434 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:39,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:44,261 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:46,498 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:50,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:52,861 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:32:58,714 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:02,728 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:06,735 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:10,757 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:14,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:18,266 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:22,272 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:26,278 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:30,329 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:35,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:38,775 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:41,496 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:45,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:49,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:53,518 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:33:57,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:34:52,694 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:34:56,734 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:00,744 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:04,761 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:07,030 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:11,047 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:15,066 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:17,107 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:21,113 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:26,043 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:28,093 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:29,512 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:31,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:33,545 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:36,170 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:46,612 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:51,160 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:55,170 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:59,189 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:04,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:08,768 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:12,779 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:15,143 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:19,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:23,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:27,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:31,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:35,341 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:39,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:43,362 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:47,376 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:51,426 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:55,439 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:58,420 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:02,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:03,510 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:06,045 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:10,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:14,070 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:16,170 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:20,172 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:22,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:26,766 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:30,782 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:33,150 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:48,971 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:53,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:57,126 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:59,958 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:03,972 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:05,107 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:09,113 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:10,706 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:14,726 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:18,742 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:22,769 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:25,647 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:28,919 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:06,132 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:10,154 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:14,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:25,670 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:26,748 INFO L93 Difference]: Finished difference Result 1163 states and 3260 transitions. [2025-04-13 18:39:26,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:39:26,749 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:39:26,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:26,753 INFO L225 Difference]: With dead ends: 1163 [2025-04-13 18:39:26,753 INFO L226 Difference]: Without dead ends: 1146 [2025-04-13 18:39:26,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 183.0s TimeCoverageRelationStatistics Valid=713, Invalid=2558, Unknown=39, NotChecked=112, Total=3422 [2025-04-13 18:39:26,754 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 157 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 58 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 331.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 331.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:26,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 34 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 706 Invalid, 65 Unknown, 119 Unchecked, 331.9s Time] [2025-04-13 18:39:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-04-13 18:39:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 615. [2025-04-13 18:39:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 2.8289902280130295) internal successors, (1737), 614 states have internal predecessors, (1737), 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 18:39:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1737 transitions. [2025-04-13 18:39:26,965 INFO L79 Accepts]: Start accepts. Automaton has 615 states and 1737 transitions. Word has length 21 [2025-04-13 18:39:26,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:26,965 INFO L485 AbstractCegarLoop]: Abstraction has 615 states and 1737 transitions. [2025-04-13 18:39:26,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 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 18:39:26,965 INFO L278 IsEmpty]: Start isEmpty. Operand 615 states and 1737 transitions. [2025-04-13 18:39:26,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:39:26,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:26,966 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:26,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:39:27,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:27,170 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:39:27,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1550636300, now seen corresponding path program 20 times [2025-04-13 18:39:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:27,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633994714] [2025-04-13 18:39:27,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:39:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:27,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:27,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:27,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:27,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:27,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633994714] [2025-04-13 18:39:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633994714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:27,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504103651] [2025-04-13 18:39:27,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:39:27,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:27,349 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:39:27,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:39:27,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:27,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:27,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:27,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:27,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:39:27,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:27,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504103651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:28,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 23 [2025-04-13 18:39:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268652999] [2025-04-13 18:39:28,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:28,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:39:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:28,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:39:28,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:39:28,019 INFO L87 Difference]: Start difference. First operand 615 states and 1737 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 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 18:39:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:30,269 INFO L93 Difference]: Finished difference Result 1446 states and 4166 transitions. [2025-04-13 18:39:30,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 18:39:30,270 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:39:30,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:30,275 INFO L225 Difference]: With dead ends: 1446 [2025-04-13 18:39:30,275 INFO L226 Difference]: Without dead ends: 1433 [2025-04-13 18:39:30,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:39:30,276 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 216 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:30,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 16 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:39:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-04-13 18:39:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1001. [2025-04-13 18:39:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 2.917) internal successors, (2917), 1000 states have internal predecessors, (2917), 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 18:39:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2917 transitions. [2025-04-13 18:39:30,658 INFO L79 Accepts]: Start accepts. Automaton has 1001 states and 2917 transitions. Word has length 21 [2025-04-13 18:39:30,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:30,658 INFO L485 AbstractCegarLoop]: Abstraction has 1001 states and 2917 transitions. [2025-04-13 18:39:30,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 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 18:39:30,659 INFO L278 IsEmpty]: Start isEmpty. Operand 1001 states and 2917 transitions. [2025-04-13 18:39:30,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:39:30,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:30,660 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:30,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 18:39:30,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:30,861 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:39:30,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1409426960, now seen corresponding path program 21 times [2025-04-13 18:39:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:30,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930993280] [2025-04-13 18:39:30,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:39:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:30,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:39:30,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:30,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:39:30,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:31,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930993280] [2025-04-13 18:39:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930993280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:31,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413744533] [2025-04-13 18:39:31,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:39:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:31,057 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:39:31,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:39:31,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:39:31,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:31,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:39:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:31,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:39:31,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:31,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413744533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:31,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:31,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 18:39:31,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112547145] [2025-04-13 18:39:31,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:31,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:39:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:31,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:39:31,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:39:31,610 INFO L87 Difference]: Start difference. First operand 1001 states and 2917 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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 18:39:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:34,029 INFO L93 Difference]: Finished difference Result 1434 states and 4039 transitions. [2025-04-13 18:39:34,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:39:34,029 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:39:34,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:34,034 INFO L225 Difference]: With dead ends: 1434 [2025-04-13 18:39:34,034 INFO L226 Difference]: Without dead ends: 1423 [2025-04-13 18:39:34,035 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:39:34,035 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:34,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 27 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:39:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-04-13 18:39:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1075. [2025-04-13 18:39:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 2.9134078212290504) internal successors, (3129), 1074 states have internal predecessors, (3129), 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 18:39:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 3129 transitions. [2025-04-13 18:39:34,503 INFO L79 Accepts]: Start accepts. Automaton has 1075 states and 3129 transitions. Word has length 21 [2025-04-13 18:39:34,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:34,503 INFO L485 AbstractCegarLoop]: Abstraction has 1075 states and 3129 transitions. [2025-04-13 18:39:34,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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 18:39:34,503 INFO L278 IsEmpty]: Start isEmpty. Operand 1075 states and 3129 transitions. [2025-04-13 18:39:34,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:39:34,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:34,504 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:34,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:39:34,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 18:39:34,705 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:39:34,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1582987358, now seen corresponding path program 22 times [2025-04-13 18:39:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:34,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067446015] [2025-04-13 18:39:34,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:34,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:34,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:34,715 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:34,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067446015] [2025-04-13 18:39:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067446015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:34,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467276331] [2025-04-13 18:39:34,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:34,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:34,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:34,858 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:39:34,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:39:34,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:34,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:34,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:34,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:34,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:39:34,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:35,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467276331] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:35,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:35,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2025-04-13 18:39:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084754093] [2025-04-13 18:39:35,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:35,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:39:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:35,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:39:35,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:39:35,256 INFO L87 Difference]: Start difference. First operand 1075 states and 3129 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 18:39:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:36,863 INFO L93 Difference]: Finished difference Result 1585 states and 4573 transitions. [2025-04-13 18:39:36,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:39:36,864 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:39:36,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:36,870 INFO L225 Difference]: With dead ends: 1585 [2025-04-13 18:39:36,870 INFO L226 Difference]: Without dead ends: 1549 [2025-04-13 18:39:36,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=438, Invalid=1542, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:39:36,871 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 148 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:36,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 37 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:39:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-04-13 18:39:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1145. [2025-04-13 18:39:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 2.870629370629371) internal successors, (3284), 1144 states have internal predecessors, (3284), 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 18:39:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3284 transitions. [2025-04-13 18:39:37,401 INFO L79 Accepts]: Start accepts. Automaton has 1145 states and 3284 transitions. Word has length 21 [2025-04-13 18:39:37,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:37,402 INFO L485 AbstractCegarLoop]: Abstraction has 1145 states and 3284 transitions. [2025-04-13 18:39:37,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 18:39:37,402 INFO L278 IsEmpty]: Start isEmpty. Operand 1145 states and 3284 transitions. [2025-04-13 18:39:37,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:39:37,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:37,403 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:37,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 18:39:37,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 18:39:37,604 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:39:37,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -165014174, now seen corresponding path program 23 times [2025-04-13 18:39:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:37,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645567926] [2025-04-13 18:39:37,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:37,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:37,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:37,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:37,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:37,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645567926] [2025-04-13 18:39:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645567926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:37,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468174077] [2025-04-13 18:39:37,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:37,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:37,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:37,768 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:39:37,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:39:37,797 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:39:37,809 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:37,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:37,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:37,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:39:37,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:37,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468174077] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:38,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2025-04-13 18:39:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804714977] [2025-04-13 18:39:38,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:38,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:39:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:38,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:39:38,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:39:38,089 INFO L87 Difference]: Start difference. First operand 1145 states and 3284 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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 18:39:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:40,994 INFO L93 Difference]: Finished difference Result 1704 states and 4803 transitions. [2025-04-13 18:39:40,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:39:40,995 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:39:40,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:41,001 INFO L225 Difference]: With dead ends: 1704 [2025-04-13 18:39:41,001 INFO L226 Difference]: Without dead ends: 1677 [2025-04-13 18:39:41,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:39:41,005 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 201 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:41,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 48 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:39:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-04-13 18:39:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1161. [2025-04-13 18:39:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 2.8689655172413793) internal successors, (3328), 1160 states have internal predecessors, (3328), 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 18:39:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 3328 transitions. [2025-04-13 18:39:41,493 INFO L79 Accepts]: Start accepts. Automaton has 1161 states and 3328 transitions. Word has length 21 [2025-04-13 18:39:41,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:41,493 INFO L485 AbstractCegarLoop]: Abstraction has 1161 states and 3328 transitions. [2025-04-13 18:39:41,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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 18:39:41,493 INFO L278 IsEmpty]: Start isEmpty. Operand 1161 states and 3328 transitions. [2025-04-13 18:39:41,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:39:41,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:41,495 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:41,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 18:39:41,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:39:41,695 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:39:41,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -826511404, now seen corresponding path program 24 times [2025-04-13 18:39:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:41,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165406220] [2025-04-13 18:39:41,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:39:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:41,698 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:39:41,701 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:41,701 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:39:41,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:41,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165406220] [2025-04-13 18:39:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165406220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:41,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666771654] [2025-04-13 18:39:41,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:39:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:41,814 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:39:41,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:39:41,834 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:39:41,848 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:39:41,848 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:39:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:41,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:39:41,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:42,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666771654] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:42,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-04-13 18:39:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609226630] [2025-04-13 18:39:42,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:42,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:39:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:42,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:39:42,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:39:42,713 INFO L87 Difference]: Start difference. First operand 1161 states and 3328 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:39:44,687 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:54,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:58,178 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:02,192 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:06,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:10,205 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:14,234 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:19,016 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:23,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:27,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:29,499 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:33,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:37,532 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:40:41,564 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~M~0 4294967296))) (let ((.cse1 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (* 4294967295 c_~M~0)) (.cse4 (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse2))) (and (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse0 (* v_y_171 4294967296))) (or (not (= (+ (* 4294967295 v_z_171) .cse0) 2)) (< (+ .cse1 (* v_z_171 4294967296) .cse0) 4294967296) (< 4294967295 (+ .cse1 v_z_171))))) (or (< (+ .cse2 (mod (+ .cse3 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) 4294967296) .cse4) (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse6 (* v_y_171 4294967296))) (let ((.cse5 (+ (* 4294967295 v_z_171) .cse6))) (or (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse5) (< .cse5 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 1)) (< (+ .cse1 (* v_z_171 4294967296) .cse6) 4294967296) (< 4294967295 (+ .cse1 v_z_171)))))) (or (< (+ .cse2 (mod (+ .cse3 c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) 4294967296) .cse4)))) is different from false [2025-04-13 18:40:54,313 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:41:48,429 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:05,139 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:11,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:13,667 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:17,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:22,144 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:23,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:29,690 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:33,699 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:36,114 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:52,954 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:42:56,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:01,479 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~counter~0 4294967296)) (.cse12 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse2 (mod c_~M~0 4294967296)) (.cse13 (* 4294967295 c_~M~0))) (let ((.cse0 (< (+ .cse2 (mod (+ .cse13 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) 4294967296)) (.cse5 (< .cse12 .cse2)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse7 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (< .cse4 1))) (and (or .cse0 (and (or (< .cse1 .cse2) .cse3) (or (< 0 .cse4) .cse5))) (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse6 (* v_y_171 4294967296))) (or (not (= (+ (* 4294967295 v_z_171) .cse6) 2)) (< (+ .cse7 (* v_z_171 4294967296) .cse6) 4294967296) (< 4294967295 (+ .cse7 v_z_171))))) (or .cse0 .cse5) (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse9 (* v_y_171 4294967296))) (let ((.cse8 (+ (* 4294967295 v_z_171) .cse9))) (or (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse8) (< .cse8 (+ .cse1 1)) (< (+ .cse7 (* v_z_171 4294967296) .cse9) 4294967296) (< 4294967295 (+ .cse7 v_z_171)))))) (or (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse10 (* v_y_171 4294967296))) (let ((.cse11 (+ (* 4294967295 v_z_171) .cse10))) (or (< (+ .cse7 (* v_z_171 4294967296) .cse10) 4294967296) (< .cse1 .cse11) (< .cse11 (+ .cse12 1)) (< 4294967295 (+ .cse7 v_z_171)))))) .cse3) (< (+ .cse2 (mod (+ .cse13 c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) 4294967296)))) is different from false [2025-04-13 18:43:23,625 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:25,582 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:29,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:31,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:31,736 INFO L93 Difference]: Finished difference Result 1890 states and 5382 transitions. [2025-04-13 18:43:31,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:43:31,737 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:43:31,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:31,746 INFO L225 Difference]: With dead ends: 1890 [2025-04-13 18:43:31,746 INFO L226 Difference]: Without dead ends: 1877 [2025-04-13 18:43:31,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 122.2s TimeCoverageRelationStatistics Valid=416, Invalid=1130, Unknown=22, NotChecked=154, Total=1722 [2025-04-13 18:43:31,747 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 45 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 106.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:31,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 37 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 570 Invalid, 21 Unknown, 134 Unchecked, 106.3s Time] [2025-04-13 18:43:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-04-13 18:43:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1258. [2025-04-13 18:43:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 2.8838504375497216) internal successors, (3625), 1257 states have internal predecessors, (3625), 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 18:43:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 3625 transitions. [2025-04-13 18:43:32,305 INFO L79 Accepts]: Start accepts. Automaton has 1258 states and 3625 transitions. Word has length 21 [2025-04-13 18:43:32,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:32,305 INFO L485 AbstractCegarLoop]: Abstraction has 1258 states and 3625 transitions. [2025-04-13 18:43:32,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:43:32,305 INFO L278 IsEmpty]: Start isEmpty. Operand 1258 states and 3625 transitions. [2025-04-13 18:43:32,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:43:32,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:32,307 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:43:32,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 18:43:32,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:32,507 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:43:32,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 32957772, now seen corresponding path program 25 times [2025-04-13 18:43:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:32,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143261443] [2025-04-13 18:43:32,508 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:43:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:32,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:43:32,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:32,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:32,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:43:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:32,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143261443] [2025-04-13 18:43:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143261443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:32,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200362034] [2025-04-13 18:43:32,581 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:43:32,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:32,582 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:43:32,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:43:32,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:43:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:32,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:43:32,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:32,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200362034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:32,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 20 [2025-04-13 18:43:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689407345] [2025-04-13 18:43:32,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:32,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:43:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:32,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:43:32,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:43:32,991 INFO L87 Difference]: Start difference. First operand 1258 states and 3625 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 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 18:43:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:35,163 INFO L93 Difference]: Finished difference Result 1818 states and 5212 transitions. [2025-04-13 18:43:35,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:43:35,164 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:43:35,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:35,169 INFO L225 Difference]: With dead ends: 1818 [2025-04-13 18:43:35,169 INFO L226 Difference]: Without dead ends: 1800 [2025-04-13 18:43:35,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=769, Invalid=2653, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:43:35,170 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 137 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:35,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 7 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:43:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-04-13 18:43:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1385. [2025-04-13 18:43:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 2.89378612716763) internal successors, (4005), 1384 states have internal predecessors, (4005), 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 18:43:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 4005 transitions. [2025-04-13 18:43:35,838 INFO L79 Accepts]: Start accepts. Automaton has 1385 states and 4005 transitions. Word has length 21 [2025-04-13 18:43:35,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:35,838 INFO L485 AbstractCegarLoop]: Abstraction has 1385 states and 4005 transitions. [2025-04-13 18:43:35,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 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 18:43:35,839 INFO L278 IsEmpty]: Start isEmpty. Operand 1385 states and 4005 transitions. [2025-04-13 18:43:35,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:43:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:35,841 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:43:35,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 18:43:36,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:36,041 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:43:36,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -762116736, now seen corresponding path program 26 times [2025-04-13 18:43:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:36,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198510270] [2025-04-13 18:43:36,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:43:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:36,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:43:36,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:36,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:43:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:36,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198510270] [2025-04-13 18:43:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198510270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:36,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908673679] [2025-04-13 18:43:36,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:43:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:36,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:43:36,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:43:36,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:43:36,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:36,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:43:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:36,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:43:36,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:36,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908673679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:37,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-04-13 18:43:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189043419] [2025-04-13 18:43:37,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:37,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:43:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:37,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:43:37,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:43:37,141 INFO L87 Difference]: Start difference. First operand 1385 states and 4005 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 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 18:43:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:42,047 INFO L93 Difference]: Finished difference Result 1973 states and 5612 transitions. [2025-04-13 18:43:42,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 18:43:42,048 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:43:42,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:42,053 INFO L225 Difference]: With dead ends: 1973 [2025-04-13 18:43:42,053 INFO L226 Difference]: Without dead ends: 1946 [2025-04-13 18:43:42,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1061, Invalid=4051, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 18:43:42,054 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:42,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:43:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2025-04-13 18:43:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1507. [2025-04-13 18:43:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 2.8306772908366535) internal successors, (4263), 1506 states have internal predecessors, (4263), 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 18:43:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 4263 transitions. [2025-04-13 18:43:42,768 INFO L79 Accepts]: Start accepts. Automaton has 1507 states and 4263 transitions. Word has length 21 [2025-04-13 18:43:42,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:42,768 INFO L485 AbstractCegarLoop]: Abstraction has 1507 states and 4263 transitions. [2025-04-13 18:43:42,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 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 18:43:42,768 INFO L278 IsEmpty]: Start isEmpty. Operand 1507 states and 4263 transitions. [2025-04-13 18:43:42,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:43:42,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:42,770 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:43:42,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 18:43:42,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 18:43:42,970 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:43:42,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -472422946, now seen corresponding path program 27 times [2025-04-13 18:43:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:42,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409630047] [2025-04-13 18:43:42,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:43:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:42,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:43:42,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:42,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:43:42,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:43,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409630047] [2025-04-13 18:43:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409630047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:43,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520377761] [2025-04-13 18:43:43,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:43:43,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:43,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:43,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:43:43,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:43:43,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:43:43,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:43,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:43:43,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:43:43,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:43,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520377761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:43,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-04-13 18:43:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473566519] [2025-04-13 18:43:43,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:43,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:43:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:43,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:43:43,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:43:43,561 INFO L87 Difference]: Start difference. First operand 1507 states and 4263 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 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 18:43:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:45,319 INFO L93 Difference]: Finished difference Result 2063 states and 5922 transitions. [2025-04-13 18:43:45,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:43:45,319 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:43:45,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:45,324 INFO L225 Difference]: With dead ends: 2063 [2025-04-13 18:43:45,324 INFO L226 Difference]: Without dead ends: 2050 [2025-04-13 18:43:45,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:43:45,325 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:45,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 36 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:43:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-04-13 18:43:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1883. [2025-04-13 18:43:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 2.8825717321997875) internal successors, (5425), 1882 states have internal predecessors, (5425), 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 18:43:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5425 transitions. [2025-04-13 18:43:46,254 INFO L79 Accepts]: Start accepts. Automaton has 1883 states and 5425 transitions. Word has length 21 [2025-04-13 18:43:46,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:46,254 INFO L485 AbstractCegarLoop]: Abstraction has 1883 states and 5425 transitions. [2025-04-13 18:43:46,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 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 18:43:46,254 INFO L278 IsEmpty]: Start isEmpty. Operand 1883 states and 5425 transitions. [2025-04-13 18:43:46,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:43:46,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:46,256 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:43:46,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:43:46,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 18:43:46,457 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:43:46,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 245836890, now seen corresponding path program 28 times [2025-04-13 18:43:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:46,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529337575] [2025-04-13 18:43:46,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:43:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:46,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:43:46,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:46,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:43:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:46,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529337575] [2025-04-13 18:43:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529337575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:46,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242465156] [2025-04-13 18:43:46,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:43:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:46,655 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:43:46,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:43:46,677 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:43:46,688 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:43:46,688 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:43:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:46,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:43:46,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:46,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242465156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:08,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 23 [2025-04-13 18:44:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243389709] [2025-04-13 18:44:08,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:08,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:44:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:08,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:44:08,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=369, Unknown=4, NotChecked=0, Total=506 [2025-04-13 18:44:08,139 INFO L87 Difference]: Start difference. First operand 1883 states and 5425 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:44:11,092 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:17,423 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:44:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:44:18,578 INFO L93 Difference]: Finished difference Result 2130 states and 6067 transitions. [2025-04-13 18:44:18,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:44:18,578 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:44:18,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:44:18,584 INFO L225 Difference]: With dead ends: 2130 [2025-04-13 18:44:18,584 INFO L226 Difference]: Without dead ends: 2115 [2025-04-13 18:44:18,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=440, Invalid=1278, Unknown=4, NotChecked=0, Total=1722 [2025-04-13 18:44:18,585 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 106 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:18,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 68 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2025-04-13 18:44:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-04-13 18:44:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1695. [2025-04-13 18:44:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 2.843565525383707) internal successors, (4817), 1694 states have internal predecessors, (4817), 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 18:44:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 4817 transitions. [2025-04-13 18:44:19,550 INFO L79 Accepts]: Start accepts. Automaton has 1695 states and 4817 transitions. Word has length 21 [2025-04-13 18:44:19,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:44:19,550 INFO L485 AbstractCegarLoop]: Abstraction has 1695 states and 4817 transitions. [2025-04-13 18:44:19,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:44:19,550 INFO L278 IsEmpty]: Start isEmpty. Operand 1695 states and 4817 transitions. [2025-04-13 18:44:19,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:44:19,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:44:19,552 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:44:19,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 18:44:19,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:19,753 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:44:19,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:44:19,753 INFO L85 PathProgramCache]: Analyzing trace with hash -730623748, now seen corresponding path program 29 times [2025-04-13 18:44:19,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:44:19,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477239663] [2025-04-13 18:44:19,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:44:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:44:19,755 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:44:19,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:19,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:44:19,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:19,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:44:19,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477239663] [2025-04-13 18:44:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477239663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:44:19,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314254117] [2025-04-13 18:44:19,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:44:19,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:19,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:44:19,895 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:44:19,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:44:19,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:44:19,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:19,925 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:44:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:19,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:44:19,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:44:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:20,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314254117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:20,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-04-13 18:44:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577791193] [2025-04-13 18:44:20,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:20,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:44:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:20,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:44:20,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:44:20,223 INFO L87 Difference]: Start difference. First operand 1695 states and 4817 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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 18:44:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:44:23,520 INFO L93 Difference]: Finished difference Result 2133 states and 6046 transitions. [2025-04-13 18:44:23,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:44:23,520 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:44:23,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:44:23,525 INFO L225 Difference]: With dead ends: 2133 [2025-04-13 18:44:23,525 INFO L226 Difference]: Without dead ends: 2102 [2025-04-13 18:44:23,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=417, Invalid=1389, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:44:23,526 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 135 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:23,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 37 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:44:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2025-04-13 18:44:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1785. [2025-04-13 18:44:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1784 states have (on average 2.837443946188341) internal successors, (5062), 1784 states have internal predecessors, (5062), 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 18:44:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 5062 transitions. [2025-04-13 18:44:24,459 INFO L79 Accepts]: Start accepts. Automaton has 1785 states and 5062 transitions. Word has length 21 [2025-04-13 18:44:24,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:44:24,459 INFO L485 AbstractCegarLoop]: Abstraction has 1785 states and 5062 transitions. [2025-04-13 18:44:24,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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 18:44:24,459 INFO L278 IsEmpty]: Start isEmpty. Operand 1785 states and 5062 transitions. [2025-04-13 18:44:24,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:44:24,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:44:24,461 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:44:24,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 18:44:24,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:24,662 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:44:24,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:44:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash 611638720, now seen corresponding path program 30 times [2025-04-13 18:44:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:44:24,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417256515] [2025-04-13 18:44:24,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:44:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:44:24,664 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:44:24,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:24,668 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:44:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:44:24,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417256515] [2025-04-13 18:44:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417256515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:44:24,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695891990] [2025-04-13 18:44:24,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:44:24,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:24,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:44:24,788 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:44:24,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:44:24,810 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 18:44:24,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:24,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:44:24,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:24,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:44:24,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:44:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:24,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695891990] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:30,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-04-13 18:44:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788700318] [2025-04-13 18:44:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:30,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:44:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:30,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:44:30,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=247, Unknown=1, NotChecked=0, Total=306 [2025-04-13 18:44:30,612 INFO L87 Difference]: Start difference. First operand 1785 states and 5062 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 18:44:32,240 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:44:34,508 INFO L93 Difference]: Finished difference Result 2803 states and 7784 transitions. [2025-04-13 18:44:34,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:44:34,509 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:44:34,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:44:34,515 INFO L225 Difference]: With dead ends: 2803 [2025-04-13 18:44:34,515 INFO L226 Difference]: Without dead ends: 2771 [2025-04-13 18:44:34,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=437, Invalid=2214, Unknown=1, NotChecked=0, Total=2652 [2025-04-13 18:44:34,516 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 126 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:34,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 28 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:44:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-04-13 18:44:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1958. [2025-04-13 18:44:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1957 states have (on average 2.854368932038835) internal successors, (5586), 1957 states have internal predecessors, (5586), 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 18:44:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 5586 transitions. [2025-04-13 18:44:35,548 INFO L79 Accepts]: Start accepts. Automaton has 1958 states and 5586 transitions. Word has length 21 [2025-04-13 18:44:35,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:44:35,548 INFO L485 AbstractCegarLoop]: Abstraction has 1958 states and 5586 transitions. [2025-04-13 18:44:35,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 18:44:35,548 INFO L278 IsEmpty]: Start isEmpty. Operand 1958 states and 5586 transitions. [2025-04-13 18:44:35,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:44:35,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:44:35,550 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:44:35,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 18:44:35,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:35,751 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:44:35,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:44:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash -504611370, now seen corresponding path program 31 times [2025-04-13 18:44:35,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:44:35,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320229904] [2025-04-13 18:44:35,751 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:44:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:44:35,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:44:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:44:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:44:35,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320229904] [2025-04-13 18:44:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320229904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:44:35,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001716636] [2025-04-13 18:44:35,906 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:44:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:44:35,908 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:44:35,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:44:35,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:44:35,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:44:35,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:44:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:35,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:44:35,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:44:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:36,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:48,373 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:44:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:48,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001716636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:48,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:48,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2025-04-13 18:44:48,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363504623] [2025-04-13 18:44:48,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:48,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:44:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:48,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:44:48,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:44:48,540 INFO L87 Difference]: Start difference. First operand 1958 states and 5586 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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 18:44:53,128 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 18:44:58,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:44:58,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:44:58,277 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 145 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:58,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 52 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 331 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 18:44:58,278 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 18:44:58,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 18:44:58,297 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:44:58,298 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:44:58,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:44:58,479 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1958states) and FLOYD_HOARE automaton (currently 28 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (1536 states constructed, input type IntersectNwa). [2025-04-13 18:44:58,480 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 18:44:58,480 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 18:44:58,482 INFO L422 BasicCegarLoop]: Path program histogram: [31, 4, 1, 1] [2025-04-13 18:44:58,484 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:44:58,484 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:44:58,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:44:58 BasicIcfg [2025-04-13 18:44:58,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:44:58,486 INFO L158 Benchmark]: Toolchain (without parser) took 875276.97ms. Allocated memory was 125.8MB in the beginning and 977.3MB in the end (delta: 851.4MB). Free memory was 86.9MB in the beginning and 516.4MB in the end (delta: -429.4MB). Peak memory consumption was 580.2MB. Max. memory is 8.0GB. [2025-04-13 18:44:58,486 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:44:58,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.86ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 72.7MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:44:58,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.99ms. Allocated memory is still 125.8MB. Free memory was 72.7MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:44:58,487 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:44:58,487 INFO L158 Benchmark]: RCFGBuilder took 328.81ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 46.2MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 18:44:58,487 INFO L158 Benchmark]: TraceAbstraction took 874647.83ms. Allocated memory was 125.8MB in the beginning and 977.3MB in the end (delta: 851.4MB). Free memory was 45.2MB in the beginning and 516.4MB in the end (delta: -471.1MB). Peak memory consumption was 538.2MB. Max. memory is 8.0GB. [2025-04-13 18:44:58,487 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.86ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 72.7MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.99ms. Allocated memory is still 125.8MB. Free memory was 72.7MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 328.81ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 46.2MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 874647.83ms. Allocated memory was 125.8MB in the beginning and 977.3MB in the end (delta: 851.4MB). Free memory was 45.2MB in the beginning and 516.4MB in the end (delta: -471.1MB). Peak memory consumption was 538.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (1958states) and FLOYD_HOARE automaton (currently 28 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (1536 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1958states) and FLOYD_HOARE automaton (currently 28 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (1536 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1958states) and FLOYD_HOARE automaton (currently 28 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (1536 states constructed, input type IntersectNwa). - 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: 874.6s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 31, EmptinessCheckTime: 0.0s, AutomataDifference: 802.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 mSolverCounterUnknown, 3124 SdHoareTripleChecker+Valid, 466.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3124 mSDsluCounter, 637 SdHoareTripleChecker+Invalid, 463.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 253 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14328 IncrementalHoareTripleChecker+Invalid, 15553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 883 mSolverCounterUnsat, 99 mSDtfsCounter, 14328 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1752 GetRequests, 745 SyntacticMatches, 17 SemanticMatches, 990 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11700 ImplicationChecksByTransitivity, 365.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1958occurred in iteration=36, InterpolantAutomatonStates: 808, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 7457 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 54.8s InterpolantComputationTime, 1253 NumberOfCodeBlocks, 1253 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 1632 ConstructedInterpolants, 20 QuantifiedInterpolants, 17787 SizeOfPredicates, 224 NumberOfNonLiveVariables, 2912 ConjunctsInSsa, 405 ConjunctsInUnsatCore, 91 InterpolantComputations, 14 PerfectInterpolantSequences, 44/325 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown