/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/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:00:35,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:00:35,940 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:00:35,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:00:35,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:00:35,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:00:35,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:00:35,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:00:35,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:00:35,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:00:35,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:00:35,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:00:35,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:00:35,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:00:35,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:00:35,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:00:35,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:00:35,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:00:35,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:00:35,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:00:35,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:00:35,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:00:35,966 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:00:36,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:00:36,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:00:36,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:00:36,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:00:36,210 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:00:36,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-13 18:00:37,545 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a124b60/8f5f2ef8726e40dfafcfe22ad806b706/FLAG48ca212e1 [2025-04-13 18:00:37,773 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:00:37,775 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-13 18:00:37,782 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a124b60/8f5f2ef8726e40dfafcfe22ad806b706/FLAG48ca212e1 [2025-04-13 18:00:38,595 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a124b60/8f5f2ef8726e40dfafcfe22ad806b706 [2025-04-13 18:00:38,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:00:38,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:00:38,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:00:38,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:00:38,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:00:38,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ed6845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38, skipping insertion in model container [2025-04-13 18:00:38,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:00:38,784 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/mult-comm.wvr.c[1936,1949] [2025-04-13 18:00:38,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:00:38,796 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:00:38,825 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/mult-comm.wvr.c[1936,1949] [2025-04-13 18:00:38,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:00:38,838 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:00:38,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38 WrapperNode [2025-04-13 18:00:38,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:00:38,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:00:38,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:00:38,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:00:38,846 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:00:38" (1/1) ... [2025-04-13 18:00:38,854 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:00:38" (1/1) ... [2025-04-13 18:00:38,869 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-13 18:00:38,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:00:38,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:00:38,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:00:38,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:00:38,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,890 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:00:38,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:00:38,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:00:38,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:00:38,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:00:38,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (1/1) ... [2025-04-13 18:00:38,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:00:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:38,924 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:00:38,926 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:00:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:00:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:00:38,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:00:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:00:38,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:00:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:00:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:00:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:00:38,942 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:00:39,009 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:00:39,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:00:39,096 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:00:39,096 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:00:39,096 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:00:39,199 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:00:39,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:00:39 BoogieIcfgContainer [2025-04-13 18:00:39,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:00:39,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:00:39,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:00:39,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:00:39,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:00:38" (1/3) ... [2025-04-13 18:00:39,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ecd672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:00:39, skipping insertion in model container [2025-04-13 18:00:39,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:00:38" (2/3) ... [2025-04-13 18:00:39,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ecd672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:00:39, skipping insertion in model container [2025-04-13 18:00:39,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:00:39" (3/3) ... [2025-04-13 18:00:39,208 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-13 18:00:39,218 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:00:39,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 18:00:39,220 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:00:39,248 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:00:39,270 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 18:00:39,281 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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:00:39,298 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:00:39,306 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;@4b63c071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:00:39,306 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:00:39,307 INFO L278 IsEmpty]: Start isEmpty. Operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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:00:39,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 18:00:39,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:39,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:39,313 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:00:39,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -46896996, now seen corresponding path program 1 times [2025-04-13 18:00:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:39,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835034058] [2025-04-13 18:00:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:39,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 18:00:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 18:00:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:39,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:39,641 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:00:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:39,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835034058] [2025-04-13 18:00:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835034058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:00:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:00:39,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:00:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022967575] [2025-04-13 18:00:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:00:39,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:00:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:39,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:00:39,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:00:39,664 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:39,727 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2025-04-13 18:00:39,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:00:39,730 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 18:00:39,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:39,736 INFO L225 Difference]: With dead ends: 56 [2025-04-13 18:00:39,737 INFO L226 Difference]: Without dead ends: 51 [2025-04-13 18:00:39,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:00:39,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:39,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:00:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-13 18:00:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-13 18:00:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 0 states have call successors, (0), 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:00:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2025-04-13 18:00:39,765 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 12 [2025-04-13 18:00:39,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:39,765 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 114 transitions. [2025-04-13 18:00:39,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:39,766 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 114 transitions. [2025-04-13 18:00:39,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:39,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:39,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:39,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:00:39,766 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:00:39,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2041179824, now seen corresponding path program 1 times [2025-04-13 18:00:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:39,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920367292] [2025-04-13 18:00:39,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:39,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:00:39,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:39,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:39,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:40,018 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:00:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:40,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920367292] [2025-04-13 18:00:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920367292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:40,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785744753] [2025-04-13 18:00:40,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:40,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:40,022 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:00:40,024 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:00:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:00:40,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:40,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:40,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:00:40,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:40,157 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:00:40,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:00:40,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785744753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:40,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2025-04-13 18:00:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737213383] [2025-04-13 18:00:40,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:40,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:00:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:40,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:00:40,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:00:40,377 INFO L87 Difference]: Start difference. First operand 51 states and 114 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:40,507 INFO L93 Difference]: Finished difference Result 59 states and 126 transitions. [2025-04-13 18:00:40,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:00:40,507 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:40,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:40,508 INFO L225 Difference]: With dead ends: 59 [2025-04-13 18:00:40,508 INFO L226 Difference]: Without dead ends: 43 [2025-04-13 18:00:40,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:40,509 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:40,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:00:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-13 18:00:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-13 18:00:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 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:00:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2025-04-13 18:00:40,514 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 96 transitions. Word has length 13 [2025-04-13 18:00:40,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:40,514 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 96 transitions. [2025-04-13 18:00:40,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:40,514 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 96 transitions. [2025-04-13 18:00:40,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:40,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:40,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:40,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:00:40,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:40,715 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:00:40,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1617541085, now seen corresponding path program 1 times [2025-04-13 18:00:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:40,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177706901] [2025-04-13 18:00:40,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:40,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:00:40,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:40,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:40,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:40,908 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:00:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:40,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177706901] [2025-04-13 18:00:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177706901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:40,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114526605] [2025-04-13 18:00:40,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:40,911 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:00:40,912 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:00:40,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:00:40,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:40,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:40,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:40,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:00:40,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:41,020 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:00:41,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:41,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:00:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114526605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:41,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-04-13 18:00:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009700250] [2025-04-13 18:00:41,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:41,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:00:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:00:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:00:41,134 INFO L87 Difference]: Start difference. First operand 43 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:41,337 INFO L93 Difference]: Finished difference Result 93 states and 203 transitions. [2025-04-13 18:00:41,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:00:41,338 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:41,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:41,339 INFO L225 Difference]: With dead ends: 93 [2025-04-13 18:00:41,339 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 18:00:41,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:00:41,340 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:41,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:00:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 18:00:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2025-04-13 18:00:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.4545454545454546) internal successors, (135), 55 states have internal predecessors, (135), 0 states have call successors, (0), 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:00:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2025-04-13 18:00:41,347 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 135 transitions. Word has length 13 [2025-04-13 18:00:41,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:41,348 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 135 transitions. [2025-04-13 18:00:41,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:41,348 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 135 transitions. [2025-04-13 18:00:41,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:41,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:41,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:41,354 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:00:41,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 18:00:41,549 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:00:41,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash -623623952, now seen corresponding path program 2 times [2025-04-13 18:00:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:41,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251710776] [2025-04-13 18:00:41,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:41,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:41,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:41,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:41,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:41,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:41,683 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:00:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:41,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251710776] [2025-04-13 18:00:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251710776] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:41,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320174542] [2025-04-13 18:00:41,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:41,686 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:00:41,687 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:00:41,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:41,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:41,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:41,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:41,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:00:41,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:41,773 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:00:41,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:41,904 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:00:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320174542] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:41,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-13 18:00:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759372834] [2025-04-13 18:00:41,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:41,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:00:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:41,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:00:41,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:41,905 INFO L87 Difference]: Start difference. First operand 56 states and 135 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:00:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:42,013 INFO L93 Difference]: Finished difference Result 81 states and 190 transitions. [2025-04-13 18:00:42,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:00:42,013 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:00:42,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:42,014 INFO L225 Difference]: With dead ends: 81 [2025-04-13 18:00:42,014 INFO L226 Difference]: Without dead ends: 72 [2025-04-13 18:00:42,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:42,015 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:42,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:00:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-13 18:00:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2025-04-13 18:00:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.526315789473684) internal successors, (144), 57 states have internal predecessors, (144), 0 states have call successors, (0), 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:00:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 144 transitions. [2025-04-13 18:00:42,022 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 144 transitions. Word has length 13 [2025-04-13 18:00:42,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:42,022 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 144 transitions. [2025-04-13 18:00:42,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:00:42,022 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 144 transitions. [2025-04-13 18:00:42,023 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:42,023 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:42,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:42,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:00:42,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:42,227 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:00:42,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -709511405, now seen corresponding path program 2 times [2025-04-13 18:00:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:42,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280639666] [2025-04-13 18:00:42,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:42,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:42,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:42,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:42,349 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:00:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:42,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280639666] [2025-04-13 18:00:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280639666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:42,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94886223] [2025-04-13 18:00:42,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:42,351 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:00:42,353 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:00:42,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:42,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:42,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:42,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:00:42,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:42,437 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:00:42,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:42,551 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:00:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94886223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:42,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:42,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-13 18:00:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100029182] [2025-04-13 18:00:42,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:42,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:00:42,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:42,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:00:42,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:42,552 INFO L87 Difference]: Start difference. First operand 58 states and 144 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:42,631 INFO L93 Difference]: Finished difference Result 83 states and 199 transitions. [2025-04-13 18:00:42,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:00:42,632 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 18:00:42,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:42,633 INFO L225 Difference]: With dead ends: 83 [2025-04-13 18:00:42,633 INFO L226 Difference]: Without dead ends: 74 [2025-04-13 18:00:42,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:42,633 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:42,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:00:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-13 18:00:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2025-04-13 18:00:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.593220338983051) internal successors, (153), 59 states have internal predecessors, (153), 0 states have call successors, (0), 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:00:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 153 transitions. [2025-04-13 18:00:42,647 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 153 transitions. Word has length 13 [2025-04-13 18:00:42,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:42,647 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 153 transitions. [2025-04-13 18:00:42,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:42,647 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 153 transitions. [2025-04-13 18:00:42,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:42,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:42,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:42,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:00:42,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:42,848 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:00:42,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -651591935, now seen corresponding path program 3 times [2025-04-13 18:00:42,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:42,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521237028] [2025-04-13 18:00:42,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:00:42,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:42,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:42,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:42,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:00:42,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:42,950 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:00:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:42,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521237028] [2025-04-13 18:00:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521237028] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:42,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496081932] [2025-04-13 18:00:42,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:00:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:42,952 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:00:42,954 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:00:42,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:42,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:42,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:00:42,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:42,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:00:42,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:43,030 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:00:43,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:43,145 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:00:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496081932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:43,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2025-04-13 18:00:43,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088573816] [2025-04-13 18:00:43,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:43,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:00:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:43,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:00:43,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:00:43,146 INFO L87 Difference]: Start difference. First operand 60 states and 153 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:43,270 INFO L93 Difference]: Finished difference Result 69 states and 165 transitions. [2025-04-13 18:00:43,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:00:43,270 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:43,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:43,271 INFO L225 Difference]: With dead ends: 69 [2025-04-13 18:00:43,271 INFO L226 Difference]: Without dead ends: 58 [2025-04-13 18:00:43,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:00:43,272 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:43,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:00:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-13 18:00:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-04-13 18:00:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 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:00:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 146 transitions. [2025-04-13 18:00:43,283 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 146 transitions. Word has length 13 [2025-04-13 18:00:43,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:43,283 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 146 transitions. [2025-04-13 18:00:43,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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:00:43,283 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 146 transitions. [2025-04-13 18:00:43,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:00:43,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:43,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:43,290 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:00:43,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:43,485 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:00:43,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash -638901514, now seen corresponding path program 3 times [2025-04-13 18:00:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:43,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451123836] [2025-04-13 18:00:43,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:00:43,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:43,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:43,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:43,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:00:43,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:43,633 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:00:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:43,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451123836] [2025-04-13 18:00:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451123836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:43,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574619325] [2025-04-13 18:00:43,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:00:43,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:43,635 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:00:43,636 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:00:43,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 18:00:43,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:00:43,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:00:43,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:43,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:00:43,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:43,731 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:00:43,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:43,801 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:00:43,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574619325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:43,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:43,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2025-04-13 18:00:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108443055] [2025-04-13 18:00:43,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:43,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:00:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:43,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:00:43,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:00:43,802 INFO L87 Difference]: Start difference. First operand 58 states and 146 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:43,919 INFO L93 Difference]: Finished difference Result 97 states and 228 transitions. [2025-04-13 18:00:43,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:00:43,919 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 18:00:43,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:43,920 INFO L225 Difference]: With dead ends: 97 [2025-04-13 18:00:43,920 INFO L226 Difference]: Without dead ends: 84 [2025-04-13 18:00:43,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:00:43,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:43,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:00:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-13 18:00:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2025-04-13 18:00:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.609375) internal successors, (167), 64 states have internal predecessors, (167), 0 states have call successors, (0), 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:00:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 167 transitions. [2025-04-13 18:00:43,938 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 167 transitions. Word has length 13 [2025-04-13 18:00:43,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:43,938 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 167 transitions. [2025-04-13 18:00:43,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:43,938 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 167 transitions. [2025-04-13 18:00:43,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:00:43,939 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:43,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:43,946 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:00:44,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:44,140 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:00:44,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1395857897, now seen corresponding path program 1 times [2025-04-13 18:00:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:44,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144254539] [2025-04-13 18:00:44,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:44,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:00:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:00:44,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:44,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:44,435 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:00:44,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:44,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144254539] [2025-04-13 18:00:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144254539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:44,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577528756] [2025-04-13 18:00:44,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:00:44,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:44,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:44,438 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:00:44,439 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:00:44,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:00:44,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:00:44,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:00:44,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:44,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:00:44,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:44,721 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:00:44,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:45,016 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:00:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577528756] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:45,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:45,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:00:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798089668] [2025-04-13 18:00:45,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:45,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:00:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:45,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:00:45,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:00:45,017 INFO L87 Difference]: Start difference. First operand 65 states and 167 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:49,503 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:00:53,637 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:00:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:53,822 INFO L93 Difference]: Finished difference Result 148 states and 316 transitions. [2025-04-13 18:00:53,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:00:53,822 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:00:53,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:53,823 INFO L225 Difference]: With dead ends: 148 [2025-04-13 18:00:53,823 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 18:00:53,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:00:53,824 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:53,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 580 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-04-13 18:00:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 18:00:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2025-04-13 18:00:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.45679012345679) internal successors, (199), 81 states have internal predecessors, (199), 0 states have call successors, (0), 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:00:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 199 transitions. [2025-04-13 18:00:53,834 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 199 transitions. Word has length 14 [2025-04-13 18:00:53,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:53,834 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 199 transitions. [2025-04-13 18:00:53,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:53,834 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 199 transitions. [2025-04-13 18:00:53,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:00:53,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:53,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:00:53,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:00:54,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:54,036 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:00:54,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1268945879, now seen corresponding path program 2 times [2025-04-13 18:00:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:54,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207882403] [2025-04-13 18:00:54,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:54,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:00:54,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:00:54,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:54,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:54,475 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:00:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:54,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207882403] [2025-04-13 18:00:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207882403] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:54,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119153153] [2025-04-13 18:00:54,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:54,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:54,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:54,477 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:00:54,478 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:00:54,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:00:54,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:00:54,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:54,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:00:54,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:54,741 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:00:54,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:55,024 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:00:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119153153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:55,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:00:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435211824] [2025-04-13 18:00:55,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:55,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:00:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:00:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:00:55,026 INFO L87 Difference]: Start difference. First operand 82 states and 199 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:00:59,723 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:01:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:00,752 INFO L93 Difference]: Finished difference Result 206 states and 438 transitions. [2025-04-13 18:01:00,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:01:00,752 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:00,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:00,754 INFO L225 Difference]: With dead ends: 206 [2025-04-13 18:01:00,754 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 18:01:00,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:01:00,754 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:00,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 18:01:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 18:01:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 90. [2025-04-13 18:01:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.640449438202247) internal successors, (235), 89 states have internal predecessors, (235), 0 states have call successors, (0), 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:01:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 235 transitions. [2025-04-13 18:01:00,774 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 235 transitions. Word has length 14 [2025-04-13 18:01:00,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:00,774 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 235 transitions. [2025-04-13 18:01:00,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:00,774 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 235 transitions. [2025-04-13 18:01:00,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:00,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:00,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:00,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:01:00,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 18:01:00,975 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:01:00,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1266437669, now seen corresponding path program 3 times [2025-04-13 18:01:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:00,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927301040] [2025-04-13 18:01:00,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:00,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:00,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:00,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:00,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:01,306 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:01:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:01,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927301040] [2025-04-13 18:01:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927301040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:01,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151789399] [2025-04-13 18:01:01,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:01,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:01,308 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:01:01,309 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:01:01,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:01,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:01,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:01,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:01,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:04,269 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:01:04,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:04,614 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:01:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151789399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:04,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383620030] [2025-04-13 18:01:04,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:04,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:04,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:04,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:04,615 INFO L87 Difference]: Start difference. First operand 90 states and 235 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:09,433 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:01:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:10,138 INFO L93 Difference]: Finished difference Result 179 states and 396 transitions. [2025-04-13 18:01:10,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:01:10,138 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:10,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:10,140 INFO L225 Difference]: With dead ends: 179 [2025-04-13 18:01:10,140 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 18:01:10,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:01:10,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:10,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 433 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 18:01:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 18:01:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 84. [2025-04-13 18:01:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.5060240963855422) internal successors, (208), 83 states have internal predecessors, (208), 0 states have call successors, (0), 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:01:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 208 transitions. [2025-04-13 18:01:10,164 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 208 transitions. Word has length 14 [2025-04-13 18:01:10,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:10,165 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 208 transitions. [2025-04-13 18:01:10,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:10,165 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 208 transitions. [2025-04-13 18:01:10,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:10,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:10,165 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:10,173 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:01:10,366 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,SelfDestructingSolverStorable9 [2025-04-13 18:01:10,366 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:01:10,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2138049298, now seen corresponding path program 4 times [2025-04-13 18:01:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:10,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223878220] [2025-04-13 18:01:10,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:10,370 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:10,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:10,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:10,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:10,496 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:01:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:10,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223878220] [2025-04-13 18:01:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223878220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:10,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068691362] [2025-04-13 18:01:10,497 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:10,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:10,500 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:01:10,501 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:01:10,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:10,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:10,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 18:01:10,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:10,632 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:01:10,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:15,032 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:01:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068691362] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:15,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 13 [2025-04-13 18:01:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890528665] [2025-04-13 18:01:15,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:15,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:01:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:15,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:01:15,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2025-04-13 18:01:15,033 INFO L87 Difference]: Start difference. First operand 84 states and 208 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:01:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:15,355 INFO L93 Difference]: Finished difference Result 122 states and 283 transitions. [2025-04-13 18:01:15,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:01:15,355 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:15,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:15,357 INFO L225 Difference]: With dead ends: 122 [2025-04-13 18:01:15,357 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 18:01:15,357 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=74, Invalid=197, Unknown=1, NotChecked=0, Total=272 [2025-04-13 18:01:15,358 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:15,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:01:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 18:01:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-04-13 18:01:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.574712643678161) internal successors, (224), 87 states have internal predecessors, (224), 0 states have call successors, (0), 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:01:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2025-04-13 18:01:15,377 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 14 [2025-04-13 18:01:15,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:15,377 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2025-04-13 18:01:15,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:01:15,377 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2025-04-13 18:01:15,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:15,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:15,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:15,384 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:01:15,578 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,SelfDestructingSolverStorable10 [2025-04-13 18:01:15,578 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:01:15,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2131982931, now seen corresponding path program 4 times [2025-04-13 18:01:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:15,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521360357] [2025-04-13 18:01:15,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:15,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:15,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:15,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:15,876 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:01:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:15,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521360357] [2025-04-13 18:01:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521360357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:15,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060759418] [2025-04-13 18:01:15,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:15,879 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:01:15,880 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:01:15,901 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:15,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:15,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:15,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:15,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:15,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:16,095 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:01:16,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:16,784 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:01:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060759418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:16,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:16,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:16,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590312755] [2025-04-13 18:01:16,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:16,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:16,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:16,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:16,785 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:17,548 INFO L93 Difference]: Finished difference Result 143 states and 352 transitions. [2025-04-13 18:01:17,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:01:17,548 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:17,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:17,549 INFO L225 Difference]: With dead ends: 143 [2025-04-13 18:01:17,549 INFO L226 Difference]: Without dead ends: 134 [2025-04-13 18:01:17,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:01:17,550 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:17,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:01:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-13 18:01:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2025-04-13 18:01:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.7474747474747474) internal successors, (272), 99 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 272 transitions. [2025-04-13 18:01:17,586 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 272 transitions. Word has length 14 [2025-04-13 18:01:17,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:17,586 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 272 transitions. [2025-04-13 18:01:17,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:17,587 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 272 transitions. [2025-04-13 18:01:17,587 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:17,587 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:17,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:17,593 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:01:17,787 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,SelfDestructingSolverStorable11 [2025-04-13 18:01:17,788 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:01:17,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2129474721, now seen corresponding path program 5 times [2025-04-13 18:01:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:17,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536081450] [2025-04-13 18:01:17,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:17,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:17,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:17,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:18,168 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:01:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:18,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536081450] [2025-04-13 18:01:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536081450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:18,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064867069] [2025-04-13 18:01:18,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:18,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:18,171 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:01:18,173 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:01:18,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:18,224 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:18,224 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:18,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:18,380 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:01:18,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:19,368 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:01:19,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064867069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:19,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-13 18:01:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100685595] [2025-04-13 18:01:19,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:19,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:01:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:19,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:01:19,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:01:19,369 INFO L87 Difference]: Start difference. First operand 100 states and 272 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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:01:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:20,135 INFO L93 Difference]: Finished difference Result 143 states and 349 transitions. [2025-04-13 18:01:20,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:01:20,135 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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 14 [2025-04-13 18:01:20,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:20,136 INFO L225 Difference]: With dead ends: 143 [2025-04-13 18:01:20,137 INFO L226 Difference]: Without dead ends: 134 [2025-04-13 18:01:20,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:01:20,137 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:20,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-13 18:01:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2025-04-13 18:01:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.6736842105263157) internal successors, (254), 95 states have internal predecessors, (254), 0 states have call successors, (0), 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:01:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 254 transitions. [2025-04-13 18:01:20,167 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 254 transitions. Word has length 14 [2025-04-13 18:01:20,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:20,167 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 254 transitions. [2025-04-13 18:01:20,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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:01:20,167 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 254 transitions. [2025-04-13 18:01:20,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:20,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:20,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:20,174 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:01:20,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 18:01:20,368 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:01:20,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2074063461, now seen corresponding path program 6 times [2025-04-13 18:01:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:20,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374532701] [2025-04-13 18:01:20,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:20,372 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:20,378 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:20,378 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:20,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:20,642 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:01:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:20,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374532701] [2025-04-13 18:01:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374532701] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:20,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570697725] [2025-04-13 18:01:20,642 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:20,644 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:01:20,646 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:01:20,672 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:20,687 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:20,688 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:20,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:20,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:20,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:20,831 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:01:20,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:21,619 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:01:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570697725] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:21,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:21,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 18:01:21,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429039925] [2025-04-13 18:01:21,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:21,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:01:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:21,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:01:21,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:01:21,620 INFO L87 Difference]: Start difference. First operand 96 states and 254 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:22,093 INFO L93 Difference]: Finished difference Result 122 states and 298 transitions. [2025-04-13 18:01:22,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:01:22,094 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:22,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:22,095 INFO L225 Difference]: With dead ends: 122 [2025-04-13 18:01:22,095 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 18:01:22,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:01:22,095 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:22,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:01:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 18:01:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2025-04-13 18:01:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.686868686868687) internal successors, (266), 99 states have internal predecessors, (266), 0 states have call successors, (0), 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:01:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 266 transitions. [2025-04-13 18:01:22,125 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 266 transitions. Word has length 14 [2025-04-13 18:01:22,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:22,125 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 266 transitions. [2025-04-13 18:01:22,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:22,125 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 266 transitions. [2025-04-13 18:01:22,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:22,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:22,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 18:01:22,326 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,SelfDestructingSolverStorable13 [2025-04-13 18:01:22,326 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:01:22,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -413639225, now seen corresponding path program 7 times [2025-04-13 18:01:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:22,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378921545] [2025-04-13 18:01:22,326 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:22,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:22,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:22,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:22,600 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:01:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:22,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378921545] [2025-04-13 18:01:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378921545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:22,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812457651] [2025-04-13 18:01:22,601 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:22,603 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:01:22,605 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:01:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:22,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:22,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:22,822 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:01:22,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:23,651 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:01:23,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812457651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:23,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:23,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602296706] [2025-04-13 18:01:23,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:23,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:23,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:23,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:23,652 INFO L87 Difference]: Start difference. First operand 100 states and 266 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:24,300 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2025-04-13 18:01:24,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:01:24,300 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:24,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:24,301 INFO L225 Difference]: With dead ends: 167 [2025-04-13 18:01:24,301 INFO L226 Difference]: Without dead ends: 158 [2025-04-13 18:01:24,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:01:24,302 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:24,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:01:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-04-13 18:01:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2025-04-13 18:01:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.822429906542056) internal successors, (302), 107 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:01:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 302 transitions. [2025-04-13 18:01:24,333 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 302 transitions. Word has length 14 [2025-04-13 18:01:24,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:24,334 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 302 transitions. [2025-04-13 18:01:24,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:24,334 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 302 transitions. [2025-04-13 18:01:24,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:24,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:24,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:24,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:01:24,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:24,538 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:01:24,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash -411131015, now seen corresponding path program 8 times [2025-04-13 18:01:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:24,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505879431] [2025-04-13 18:01:24,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:01:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:24,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:24,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:24,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:24,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:24,902 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:01:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:24,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505879431] [2025-04-13 18:01:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505879431] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:24,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347701557] [2025-04-13 18:01:24,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:01:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:24,904 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:01:24,905 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:01:24,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:24,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:24,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:24,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:24,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:24,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:25,126 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:01:25,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:26,146 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:01:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347701557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:26,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912035358] [2025-04-13 18:01:26,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:26,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:26,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:26,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:26,147 INFO L87 Difference]: Start difference. First operand 108 states and 302 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:26,776 INFO L93 Difference]: Finished difference Result 146 states and 359 transitions. [2025-04-13 18:01:26,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:01:26,776 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:26,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:26,777 INFO L225 Difference]: With dead ends: 146 [2025-04-13 18:01:26,777 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 18:01:26,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:01:26,778 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:26,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 18:01:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2025-04-13 18:01:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.686868686868687) internal successors, (266), 99 states have internal predecessors, (266), 0 states have call successors, (0), 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:01:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 266 transitions. [2025-04-13 18:01:26,808 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 266 transitions. Word has length 14 [2025-04-13 18:01:26,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:26,808 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 266 transitions. [2025-04-13 18:01:26,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:26,808 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 266 transitions. [2025-04-13 18:01:26,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:26,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:26,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:26,815 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:01:27,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:01:27,009 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:01:27,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -524461745, now seen corresponding path program 9 times [2025-04-13 18:01:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:27,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454337685] [2025-04-13 18:01:27,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:27,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:27,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:27,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:27,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:27,306 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:01:27,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:27,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454337685] [2025-04-13 18:01:27,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454337685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:27,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82641897] [2025-04-13 18:01:27,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:27,308 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:01:27,310 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:01:27,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:27,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:27,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:27,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:27,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:27,509 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:01:27,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:28,425 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:01:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82641897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:28,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:28,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652427688] [2025-04-13 18:01:28,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:28,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:28,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:28,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:28,427 INFO L87 Difference]: Start difference. First operand 100 states and 266 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:28,972 INFO L93 Difference]: Finished difference Result 134 states and 332 transitions. [2025-04-13 18:01:28,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:01:28,972 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:28,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:28,973 INFO L225 Difference]: With dead ends: 134 [2025-04-13 18:01:28,973 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 18:01:28,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:01:28,974 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:28,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 18:01:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2025-04-13 18:01:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.722772277227723) internal successors, (275), 101 states have internal predecessors, (275), 0 states have call successors, (0), 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:01:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 275 transitions. [2025-04-13 18:01:29,007 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 275 transitions. Word has length 14 [2025-04-13 18:01:29,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:29,007 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 275 transitions. [2025-04-13 18:01:29,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:29,007 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 275 transitions. [2025-04-13 18:01:29,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:29,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:29,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:29,015 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:01:29,208 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,SelfDestructingSolverStorable16 [2025-04-13 18:01:29,208 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:01:29,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1689379943, now seen corresponding path program 10 times [2025-04-13 18:01:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:29,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526139064] [2025-04-13 18:01:29,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:29,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:29,215 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:29,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:29,472 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:01:29,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:29,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526139064] [2025-04-13 18:01:29,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526139064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:29,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104387335] [2025-04-13 18:01:29,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:29,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:29,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:29,474 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:01:29,475 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:01:29,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:29,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:29,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:29,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:29,706 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:01:29,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:30,048 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:01:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104387335] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:30,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 18:01:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943370435] [2025-04-13 18:01:30,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:30,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:01:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:01:30,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:01:30,049 INFO L87 Difference]: Start difference. First operand 102 states and 275 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:31,021 INFO L93 Difference]: Finished difference Result 201 states and 491 transitions. [2025-04-13 18:01:31,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:01:31,022 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:31,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:31,023 INFO L225 Difference]: With dead ends: 201 [2025-04-13 18:01:31,023 INFO L226 Difference]: Without dead ends: 188 [2025-04-13 18:01:31,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:01:31,024 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:31,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-13 18:01:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 114. [2025-04-13 18:01:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.893805309734513) internal successors, (327), 113 states have internal predecessors, (327), 0 states have call successors, (0), 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:01:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 327 transitions. [2025-04-13 18:01:31,064 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 327 transitions. Word has length 14 [2025-04-13 18:01:31,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:31,064 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 327 transitions. [2025-04-13 18:01:31,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:31,065 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 327 transitions. [2025-04-13 18:01:31,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:31,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:31,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:31,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 18:01:31,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:01:31,265 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:01:31,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1691888153, now seen corresponding path program 11 times [2025-04-13 18:01:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:31,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490419328] [2025-04-13 18:01:31,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:31,268 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:31,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:31,272 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:31,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:31,594 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:01:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:31,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490419328] [2025-04-13 18:01:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490419328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:31,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871992510] [2025-04-13 18:01:31,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:31,597 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:01:31,601 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:01:31,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:31,654 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:31,654 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:31,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:31,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:31,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:31,825 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:01:31,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:32,518 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:01:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871992510] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:32,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:32,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 18:01:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946704441] [2025-04-13 18:01:32,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:32,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:01:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:32,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:01:32,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:01:32,519 INFO L87 Difference]: Start difference. First operand 114 states and 327 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:33,776 INFO L93 Difference]: Finished difference Result 205 states and 490 transitions. [2025-04-13 18:01:33,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:01:33,776 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:33,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:33,777 INFO L225 Difference]: With dead ends: 205 [2025-04-13 18:01:33,777 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 18:01:33,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:01:33,778 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:33,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:01:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 18:01:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 108. [2025-04-13 18:01:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.803738317757009) internal successors, (300), 107 states have internal predecessors, (300), 0 states have call successors, (0), 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:01:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 300 transitions. [2025-04-13 18:01:33,815 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 300 transitions. Word has length 14 [2025-04-13 18:01:33,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:33,815 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 300 transitions. [2025-04-13 18:01:33,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:33,815 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 300 transitions. [2025-04-13 18:01:33,815 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:33,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:33,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:33,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 18:01:34,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:34,016 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:01:34,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1747299413, now seen corresponding path program 12 times [2025-04-13 18:01:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:34,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639395183] [2025-04-13 18:01:34,017 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:34,019 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:34,022 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:34,022 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:34,266 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:01:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:34,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639395183] [2025-04-13 18:01:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639395183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:34,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429554873] [2025-04-13 18:01:34,266 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:34,281 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:01:34,282 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:01:34,308 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:34,335 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:34,336 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:34,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:34,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:34,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:34,479 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:01:34,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:34,765 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:01:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429554873] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:34,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 18:01:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804455713] [2025-04-13 18:01:34,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:34,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:01:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:34,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:01:34,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:01:34,766 INFO L87 Difference]: Start difference. First operand 108 states and 300 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:35,589 INFO L93 Difference]: Finished difference Result 177 states and 417 transitions. [2025-04-13 18:01:35,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:01:35,589 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:35,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:35,590 INFO L225 Difference]: With dead ends: 177 [2025-04-13 18:01:35,590 INFO L226 Difference]: Without dead ends: 164 [2025-04-13 18:01:35,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:01:35,591 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:35,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-13 18:01:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2025-04-13 18:01:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.803738317757009) internal successors, (300), 107 states have internal predecessors, (300), 0 states have call successors, (0), 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:01:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 300 transitions. [2025-04-13 18:01:35,633 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 300 transitions. Word has length 14 [2025-04-13 18:01:35,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:35,633 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 300 transitions. [2025-04-13 18:01:35,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:35,633 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 300 transitions. [2025-04-13 18:01:35,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:35,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:35,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:35,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 18:01:35,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:35,834 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:01:35,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 887830237, now seen corresponding path program 13 times [2025-04-13 18:01:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:35,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473771557] [2025-04-13 18:01:35,834 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:35,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:36,053 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:01:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:36,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473771557] [2025-04-13 18:01:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473771557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:36,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562716129] [2025-04-13 18:01:36,054 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:36,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:36,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:36,056 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:01:36,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:01:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:36,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:36,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:36,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:36,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:36,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:36,247 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:01:36,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:36,510 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:01:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562716129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:36,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343823282] [2025-04-13 18:01:36,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:36,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:36,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:36,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:36,511 INFO L87 Difference]: Start difference. First operand 108 states and 300 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:40,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 [] [2025-04-13 18:01:45,148 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:01:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:45,467 INFO L93 Difference]: Finished difference Result 175 states and 408 transitions. [2025-04-13 18:01:45,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:01:45,467 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:45,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:45,468 INFO L225 Difference]: With dead ends: 175 [2025-04-13 18:01:45,468 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 18:01:45,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:01:45,469 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:45,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 470 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-04-13 18:01:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 18:01:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 112. [2025-04-13 18:01:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.7567567567567566) internal successors, (306), 111 states have internal predecessors, (306), 0 states have call successors, (0), 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:01:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 306 transitions. [2025-04-13 18:01:45,512 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 306 transitions. Word has length 14 [2025-04-13 18:01:45,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:45,512 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 306 transitions. [2025-04-13 18:01:45,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:45,512 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 306 transitions. [2025-04-13 18:01:45,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:45,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:45,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:45,519 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:01:45,713 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,SelfDestructingSolverStorable20 [2025-04-13 18:01:45,714 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:01:45,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1707813969, now seen corresponding path program 14 times [2025-04-13 18:01:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:45,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501998252] [2025-04-13 18:01:45,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:01:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:45,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:45,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:45,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:45,965 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:01:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:45,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501998252] [2025-04-13 18:01:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501998252] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:45,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445080707] [2025-04-13 18:01:45,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:01:45,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:45,967 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:01:45,969 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:01:45,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:46,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:46,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:46,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:46,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:46,211 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:01:46,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:46,851 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:01:46,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445080707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:46,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:46,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 18:01:46,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211569358] [2025-04-13 18:01:46,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:46,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:01:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:46,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:01:46,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:01:46,853 INFO L87 Difference]: Start difference. First operand 112 states and 306 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:47,847 INFO L93 Difference]: Finished difference Result 173 states and 430 transitions. [2025-04-13 18:01:47,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:01:47,848 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:47,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:47,849 INFO L225 Difference]: With dead ends: 173 [2025-04-13 18:01:47,849 INFO L226 Difference]: Without dead ends: 164 [2025-04-13 18:01:47,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:01:47,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:47,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:01:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-13 18:01:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2025-04-13 18:01:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.8461538461538463) internal successors, (333), 117 states have internal predecessors, (333), 0 states have call successors, (0), 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:01:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 333 transitions. [2025-04-13 18:01:47,898 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 333 transitions. Word has length 14 [2025-04-13 18:01:47,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:47,898 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 333 transitions. [2025-04-13 18:01:47,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:47,898 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 333 transitions. [2025-04-13 18:01:47,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:47,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:47,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:47,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:01:48,099 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,SelfDestructingSolverStorable21 [2025-04-13 18:01:48,099 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:01:48,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1710322179, now seen corresponding path program 15 times [2025-04-13 18:01:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:48,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337812766] [2025-04-13 18:01:48,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:48,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:48,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:48,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:48,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:48,321 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:01:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:48,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337812766] [2025-04-13 18:01:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337812766] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:48,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967101366] [2025-04-13 18:01:48,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:01:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:48,323 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:01:48,324 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:01:48,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:48,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:48,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:01:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:48,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:48,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:48,507 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:01:48,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:49,185 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:01:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967101366] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:49,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 18:01:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590969826] [2025-04-13 18:01:49,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:49,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:01:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:01:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:01:49,187 INFO L87 Difference]: Start difference. First operand 118 states and 333 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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:01:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:49,969 INFO L93 Difference]: Finished difference Result 166 states and 418 transitions. [2025-04-13 18:01:49,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:01:49,970 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:49,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:49,971 INFO L225 Difference]: With dead ends: 166 [2025-04-13 18:01:49,971 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 18:01:49,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:01:49,971 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:49,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:01:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 18:01:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2025-04-13 18:01:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.7876106194690267) internal successors, (315), 113 states have internal predecessors, (315), 0 states have call successors, (0), 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:01:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 315 transitions. [2025-04-13 18:01:50,026 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 315 transitions. Word has length 14 [2025-04-13 18:01:50,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:50,026 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 315 transitions. [2025-04-13 18:01:50,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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:01:50,026 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 315 transitions. [2025-04-13 18:01:50,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:50,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:50,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:50,034 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:01:50,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:50,228 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:01:50,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1765733439, now seen corresponding path program 16 times [2025-04-13 18:01:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:50,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038038492] [2025-04-13 18:01:50,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:50,230 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:50,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:50,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:50,441 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:01:50,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:50,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038038492] [2025-04-13 18:01:50,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038038492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:50,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429147447] [2025-04-13 18:01:50,441 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:01:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:50,443 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:01:50,444 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:01:50,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:50,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:50,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:01:50,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:50,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:50,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:50,630 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:01:50,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:51,566 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:01:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429147447] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:51,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260217124] [2025-04-13 18:01:51,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:51,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:51,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:51,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:51,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:51,568 INFO L87 Difference]: Start difference. First operand 114 states and 315 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:52,101 INFO L93 Difference]: Finished difference Result 142 states and 362 transitions. [2025-04-13 18:01:52,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:01:52,103 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:52,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:52,104 INFO L225 Difference]: With dead ends: 142 [2025-04-13 18:01:52,104 INFO L226 Difference]: Without dead ends: 133 [2025-04-13 18:01:52,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:01:52,105 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:52,105 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:01:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-13 18:01:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2025-04-13 18:01:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.710280373831776) internal successors, (290), 107 states have internal predecessors, (290), 0 states have call successors, (0), 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:01:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 290 transitions. [2025-04-13 18:01:52,147 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 290 transitions. Word has length 14 [2025-04-13 18:01:52,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:52,147 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 290 transitions. [2025-04-13 18:01:52,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:52,147 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 290 transitions. [2025-04-13 18:01:52,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:52,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:52,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:52,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:01:52,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:52,348 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:01:52,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -868809621, now seen corresponding path program 17 times [2025-04-13 18:01:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:52,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523974040] [2025-04-13 18:01:52,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:52,351 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:52,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:52,355 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:52,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:52,653 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:01:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:52,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523974040] [2025-04-13 18:01:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523974040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:52,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971853997] [2025-04-13 18:01:52,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:01:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:52,656 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:01:52,656 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:01:52,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:52,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:52,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:52,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:52,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:53,033 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:01:53,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:53,893 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:01:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971853997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:53,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:53,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 18:01:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852451082] [2025-04-13 18:01:53,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:53,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:01:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:53,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:01:53,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:01:53,894 INFO L87 Difference]: Start difference. First operand 108 states and 290 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:55,167 INFO L93 Difference]: Finished difference Result 179 states and 444 transitions. [2025-04-13 18:01:55,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:01:55,167 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:55,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:55,168 INFO L225 Difference]: With dead ends: 179 [2025-04-13 18:01:55,168 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 18:01:55,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:01:55,169 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:55,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:01:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 18:01:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2025-04-13 18:01:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.8632478632478633) internal successors, (335), 117 states have internal predecessors, (335), 0 states have call successors, (0), 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:01:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 335 transitions. [2025-04-13 18:01:55,218 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 335 transitions. Word has length 14 [2025-04-13 18:01:55,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:55,218 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 335 transitions. [2025-04-13 18:01:55,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:01:55,218 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 335 transitions. [2025-04-13 18:01:55,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:55,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:55,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:55,225 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:01:55,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 18:01:55,419 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:01:55,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -866301411, now seen corresponding path program 18 times [2025-04-13 18:01:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:55,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168783363] [2025-04-13 18:01:55,419 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:55,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:55,426 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:55,426 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:55,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:55,728 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:01:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:55,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168783363] [2025-04-13 18:01:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168783363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:55,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427139944] [2025-04-13 18:01:55,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:01:55,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:55,731 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:01:55,732 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:01:55,752 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 18:01:55,815 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:55,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:01:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:55,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:55,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:55,941 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:01:55,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:56,621 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:01:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427139944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:56,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369637085] [2025-04-13 18:01:56,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:56,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:56,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:56,622 INFO L87 Difference]: Start difference. First operand 118 states and 335 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:57,269 INFO L93 Difference]: Finished difference Result 165 states and 418 transitions. [2025-04-13 18:01:57,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:01:57,270 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:57,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:57,271 INFO L225 Difference]: With dead ends: 165 [2025-04-13 18:01:57,271 INFO L226 Difference]: Without dead ends: 156 [2025-04-13 18:01:57,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:01:57,271 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:57,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-13 18:01:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 110. [2025-04-13 18:01:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.743119266055046) internal successors, (299), 109 states have internal predecessors, (299), 0 states have call successors, (0), 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:01:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 299 transitions. [2025-04-13 18:01:57,323 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 299 transitions. Word has length 14 [2025-04-13 18:01:57,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:57,323 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 299 transitions. [2025-04-13 18:01:57,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:57,323 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 299 transitions. [2025-04-13 18:01:57,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:01:57,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:57,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:57,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 18:01:57,524 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,SelfDestructingSolverStorable25 [2025-04-13 18:01:57,524 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:01:57,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -979632141, now seen corresponding path program 19 times [2025-04-13 18:01:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:57,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982843943] [2025-04-13 18:01:57,525 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:57,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:57,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:57,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:57,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:57,748 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:01:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:01:57,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982843943] [2025-04-13 18:01:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982843943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:01:57,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810733856] [2025-04-13 18:01:57,748 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:01:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:01:57,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:01:57,750 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:01:57,750 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:01:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:01:57,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:01:57,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:01:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:01:57,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:01:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:01:57,926 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:01:57,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:01:58,732 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:01:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810733856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:01:58,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:01:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:01:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837222666] [2025-04-13 18:01:58,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:01:58,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:01:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:01:58,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:01:58,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:01:58,733 INFO L87 Difference]: Start difference. First operand 110 states and 299 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:01:59,386 INFO L93 Difference]: Finished difference Result 153 states and 385 transitions. [2025-04-13 18:01:59,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:01:59,386 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:01:59,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:01:59,387 INFO L225 Difference]: With dead ends: 153 [2025-04-13 18:01:59,387 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 18:01:59,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:01:59,387 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:59,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:01:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 18:01:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 106. [2025-04-13 18:01:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.7142857142857144) internal successors, (285), 105 states have internal predecessors, (285), 0 states have call successors, (0), 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:01:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 285 transitions. [2025-04-13 18:01:59,435 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 285 transitions. Word has length 14 [2025-04-13 18:01:59,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:01:59,435 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 285 transitions. [2025-04-13 18:01:59,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:59,436 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 285 transitions. [2025-04-13 18:01:59,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:01:59,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:01:59,436 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:01:59,442 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:01:59,636 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,SelfDestructingSolverStorable26 [2025-04-13 18:01:59,636 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:01:59,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:01:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash 90088344, now seen corresponding path program 20 times [2025-04-13 18:01:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:01:59,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395693447] [2025-04-13 18:01:59,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:01:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:01:59,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:01:59,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:01:59,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:01:59,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:00,067 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:02:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:00,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395693447] [2025-04-13 18:02:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395693447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:00,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28967055] [2025-04-13 18:02:00,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:00,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:00,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:00,069 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:02:00,071 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:02:00,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:00,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:02:00,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:02:00,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:00,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:02:00,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:00,303 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:02:00,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:02:00,751 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:02:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28967055] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:02:00,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:02:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 18:02:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882359647] [2025-04-13 18:02:00,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:02:00,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:02:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:00,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:02:00,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:02:00,752 INFO L87 Difference]: Start difference. First operand 106 states and 285 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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:02:05,113 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:02:10,072 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:02:14,208 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:02:18,629 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:02:22,647 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:02:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:22,837 INFO L93 Difference]: Finished difference Result 231 states and 548 transitions. [2025-04-13 18:02:22,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:02:22,838 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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:02:22,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:22,839 INFO L225 Difference]: With dead ends: 231 [2025-04-13 18:02:22,839 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 18:02:22,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:02:22,840 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 25 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:22,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 723 Invalid, 5 Unknown, 0 Unchecked, 21.0s Time] [2025-04-13 18:02:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 18:02:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 118. [2025-04-13 18:02:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.8119658119658117) internal successors, (329), 117 states have internal predecessors, (329), 0 states have call successors, (0), 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:02:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 329 transitions. [2025-04-13 18:02:22,900 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 329 transitions. Word has length 15 [2025-04-13 18:02:22,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:22,900 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 329 transitions. [2025-04-13 18:02:22,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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:02:22,900 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 329 transitions. [2025-04-13 18:02:22,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:02:22,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:22,900 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:22,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 18:02:23,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 18:02:23,104 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:02:23,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 172942881, now seen corresponding path program 4 times [2025-04-13 18:02:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:23,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402480567] [2025-04-13 18:02:23,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:23,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:23,111 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:02:23,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:23,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:23,216 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:02:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:23,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402480567] [2025-04-13 18:02:23,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402480567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:23,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636604271] [2025-04-13 18:02:23,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:23,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:23,219 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:02:23,220 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:02:23,244 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:23,263 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:02:23,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:23,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:23,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:02:23,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:23,379 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:02:23,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:02:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:02:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636604271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:02:23,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:02:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 14 [2025-04-13 18:02:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879122849] [2025-04-13 18:02:23,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:02:23,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:02:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:23,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:02:23,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:02:23,547 INFO L87 Difference]: Start difference. First operand 118 states and 329 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:02:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:24,090 INFO L93 Difference]: Finished difference Result 181 states and 442 transitions. [2025-04-13 18:02:24,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:02:24,090 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:02:24,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:24,091 INFO L225 Difference]: With dead ends: 181 [2025-04-13 18:02:24,091 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 18:02:24,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:02:24,092 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:24,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 18:02:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2025-04-13 18:02:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.8031496062992125) internal successors, (356), 127 states have internal predecessors, (356), 0 states have call successors, (0), 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:02:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 356 transitions. [2025-04-13 18:02:24,163 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 356 transitions. Word has length 15 [2025-04-13 18:02:24,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:24,163 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 356 transitions. [2025-04-13 18:02:24,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:02:24,163 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 356 transitions. [2025-04-13 18:02:24,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:02:24,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:24,164 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:24,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 18:02:24,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:02:24,364 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:02:24,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash -687061255, now seen corresponding path program 21 times [2025-04-13 18:02:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:24,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007707436] [2025-04-13 18:02:24,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:24,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:24,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:02:24,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:02:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:24,723 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:02:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:24,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007707436] [2025-04-13 18:02:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007707436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:24,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119541200] [2025-04-13 18:02:24,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:24,725 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:02:24,726 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:02:24,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:24,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:02:24,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:02:24,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:24,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:02:24,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:24,991 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:02:24,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:02:25,359 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:02:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119541200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:02:25,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:02:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 18:02:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942893138] [2025-04-13 18:02:25,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:02:25,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:02:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:25,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:02:25,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:02:25,360 INFO L87 Difference]: Start difference. First operand 128 states and 356 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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:02:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:26,941 INFO L93 Difference]: Finished difference Result 215 states and 516 transitions. [2025-04-13 18:02:26,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:02:26,942 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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 15 [2025-04-13 18:02:26,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:26,943 INFO L225 Difference]: With dead ends: 215 [2025-04-13 18:02:26,943 INFO L226 Difference]: Without dead ends: 202 [2025-04-13 18:02:26,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:02:26,944 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:26,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:02:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-13 18:02:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 130. [2025-04-13 18:02:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.8294573643410854) internal successors, (365), 129 states have internal predecessors, (365), 0 states have call successors, (0), 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:02:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 365 transitions. [2025-04-13 18:02:27,016 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 365 transitions. Word has length 15 [2025-04-13 18:02:27,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:27,016 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 365 transitions. [2025-04-13 18:02:27,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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:02:27,016 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 365 transitions. [2025-04-13 18:02:27,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:02:27,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:27,016 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:27,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 18:02:27,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:27,217 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:02:27,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash -604206718, now seen corresponding path program 22 times [2025-04-13 18:02:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:27,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104866738] [2025-04-13 18:02:27,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:27,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:27,225 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:02:27,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:27,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:27,581 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:02:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:27,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104866738] [2025-04-13 18:02:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104866738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:27,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181082351] [2025-04-13 18:02:27,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:27,583 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:02:27,584 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:02:27,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:27,623 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:02:27,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:27,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:02:27,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:27,809 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:02:27,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:02:28,434 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:02:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181082351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:02:28,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:02:28,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 18:02:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472956637] [2025-04-13 18:02:28,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:02:28,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:02:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:28,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:02:28,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:02:28,435 INFO L87 Difference]: Start difference. First operand 130 states and 365 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:32,650 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:02:37,358 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:02:41,517 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:02:45,976 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:02:50,053 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:02:54,066 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:02:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:54,356 INFO L93 Difference]: Finished difference Result 180 states and 477 transitions. [2025-04-13 18:02:54,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:02:54,357 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:02:54,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:54,361 INFO L225 Difference]: With dead ends: 180 [2025-04-13 18:02:54,362 INFO L226 Difference]: Without dead ends: 171 [2025-04-13 18:02:54,362 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:02:54,362 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 21 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:54,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 536 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2025-04-13 18:02:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-04-13 18:02:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2025-04-13 18:02:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.8776978417266186) internal successors, (400), 139 states have internal predecessors, (400), 0 states have call successors, (0), 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:02:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 400 transitions. [2025-04-13 18:02:54,455 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 400 transitions. Word has length 15 [2025-04-13 18:02:54,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:54,455 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 400 transitions. [2025-04-13 18:02:54,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:54,455 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 400 transitions. [2025-04-13 18:02:54,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:02:54,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:54,456 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:54,462 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:02:54,656 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,SelfDestructingSolverStorable30 [2025-04-13 18:02:54,656 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:02:54,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash 172407921, now seen corresponding path program 23 times [2025-04-13 18:02:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:54,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655099776] [2025-04-13 18:02:54,657 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:54,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:54,665 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:02:54,666 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:02:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:57,982 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:02:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:57,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655099776] [2025-04-13 18:02:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655099776] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:57,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913378953] [2025-04-13 18:02:57,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:57,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:57,984 INFO L229 MonitoredProcess]: Starting monitored process 32 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:02:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:02:58,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:02:58,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:02:58,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:02:58,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:58,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:02:58,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:58,579 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:02:58,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:16,300 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:03:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913378953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:16,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 18:03:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58083895] [2025-04-13 18:03:16,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:16,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:03:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:16,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:03:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=379, Unknown=4, NotChecked=0, Total=462 [2025-04-13 18:03:16,301 INFO L87 Difference]: Start difference. First operand 140 states and 400 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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:03:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:18,059 INFO L93 Difference]: Finished difference Result 205 states and 506 transitions. [2025-04-13 18:03:18,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:18,059 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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 15 [2025-04-13 18:03:18,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:18,060 INFO L225 Difference]: With dead ends: 205 [2025-04-13 18:03:18,060 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 18:03:18,061 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=174, Invalid=814, Unknown=4, NotChecked=0, Total=992 [2025-04-13 18:03:18,061 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:18,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:03:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 18:03:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 146. [2025-04-13 18:03:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.8275862068965516) internal successors, (410), 145 states have internal predecessors, (410), 0 states have call successors, (0), 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:03:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 410 transitions. [2025-04-13 18:03:18,165 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 410 transitions. Word has length 15 [2025-04-13 18:03:18,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:18,165 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 410 transitions. [2025-04-13 18:03:18,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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:03:18,165 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 410 transitions. [2025-04-13 18:03:18,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:03:18,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:18,166 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:18,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:03:18,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:18,366 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:03:18,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash 970330065, now seen corresponding path program 5 times [2025-04-13 18:03:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:18,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211446258] [2025-04-13 18:03:18,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:18,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:03:18,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:18,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:18,485 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:03:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:18,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211446258] [2025-04-13 18:03:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211446258] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:18,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443254946] [2025-04-13 18:03:18,486 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:18,488 INFO L229 MonitoredProcess]: Starting monitored process 33 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:03:18,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:03:18,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:03:18,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:18,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:18,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:18,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:03:18,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:18,613 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:03:18,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:18,785 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:03:18,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443254946] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:18,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 13 [2025-04-13 18:03:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114691029] [2025-04-13 18:03:18,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:18,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:03:18,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:18,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:03:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:03:18,786 INFO L87 Difference]: Start difference. First operand 146 states and 410 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:03:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:20,091 INFO L93 Difference]: Finished difference Result 208 states and 528 transitions. [2025-04-13 18:03:20,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:20,092 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:03:20,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:20,093 INFO L225 Difference]: With dead ends: 208 [2025-04-13 18:03:20,093 INFO L226 Difference]: Without dead ends: 199 [2025-04-13 18:03:20,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:03:20,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:20,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:03:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-13 18:03:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2025-04-13 18:03:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.87248322147651) internal successors, (428), 149 states have internal predecessors, (428), 0 states have call successors, (0), 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:03:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 428 transitions. [2025-04-13 18:03:20,219 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 428 transitions. Word has length 15 [2025-04-13 18:03:20,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:20,219 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 428 transitions. [2025-04-13 18:03:20,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:03:20,219 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 428 transitions. [2025-04-13 18:03:20,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:03:20,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:20,219 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:20,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 18:03:20,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:20,424 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:03:20,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1101927472, now seen corresponding path program 5 times [2025-04-13 18:03:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:20,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937825373] [2025-04-13 18:03:20,424 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:20,427 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 18:03:20,431 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:20,431 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:03:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,540 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:03:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:20,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937825373] [2025-04-13 18:03:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937825373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:20,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277079546] [2025-04-13 18:03:20,540 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:20,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:20,542 INFO L229 MonitoredProcess]: Starting monitored process 34 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:03:20,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:03:20,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 18:03:20,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:20,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:03:20,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:03:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:25,073 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:03:25,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:37,460 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse1 (+ .cse5 v_z_358)) (.cse4 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)))) (or (= .cse0 .cse1) (< v_z_358 0) (= .cse2 .cse1) (< .cse3 .cse4) (< 4294967295 v_z_358) (< .cse4 0)))) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse7 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358))) (.cse6 (+ .cse5 v_z_358))) (or (< v_z_358 0) (= .cse2 .cse6) (< .cse3 .cse7) (< .cse7 0) (< 4294967295 .cse6)))) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse8 (+ .cse5 v_z_358)) (.cse9 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)))) (or (= .cse0 .cse8) (< .cse8 4294967296) (< .cse3 .cse9) (< 4294967295 v_z_358) (< .cse9 0))))))) is different from false [2025-04-13 18:03:45,596 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:03:53,787 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:04:13,886 WARN L286 SmtUtils]: Spent 16.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:04:26,100 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse1 (+ .cse2 v_z_358))) (or (< v_z_358 0) (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0))))) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse4 (+ .cse2 v_z_358))) (or (= .cse3 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_358) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0))))) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse5 (+ .cse2 v_z_358))) (or (= .cse3 .cse5) (< v_z_358 0) (= .cse0 .cse5) (< 4294967295 v_z_358) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0)))))))) is different from false [2025-04-13 18:04:32,002 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:04:40,026 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:05:00,068 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:05:08,091 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:05:36,710 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:05:56,937 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:06:17,009 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:06:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-13 18:06:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277079546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:25,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 18:06:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205882530] [2025-04-13 18:06:25,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:25,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:06:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:25,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:06:25,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2025-04-13 18:06:25,094 INFO L87 Difference]: Start difference. First operand 150 states and 428 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:06:29,330 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse1 (+ .cse2 v_z_358))) (or (< v_z_358 0) (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0))))) (= c_~x_2~0 0) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse4 (+ .cse2 v_z_358))) (or (= .cse3 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_358) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0))))) (= c_~x_1~0 0) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse5 (+ .cse2 v_z_358))) (or (= .cse3 .cse5) (< v_z_358 0) (= .cse0 .cse5) (< 4294967295 v_z_358) (not (= (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)) 0)))))))) is different from false [2025-04-13 18:06:33,484 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse1 (+ .cse5 v_z_358)) (.cse4 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)))) (or (= .cse0 .cse1) (< v_z_358 0) (= .cse2 .cse1) (< .cse3 .cse4) (< 4294967295 v_z_358) (< .cse4 0)))) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse7 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358))) (.cse6 (+ .cse5 v_z_358))) (or (< v_z_358 0) (= .cse2 .cse6) (< .cse3 .cse7) (< .cse7 0) (< 4294967295 .cse6)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_358 Int) (v_y_358 Int)) (let ((.cse8 (+ .cse5 v_z_358)) (.cse9 (+ (* v_y_358 4294967296) (* 2863311531 v_z_358)))) (or (= .cse0 .cse8) (< .cse8 4294967296) (< .cse3 .cse9) (< 4294967295 v_z_358) (< .cse9 0))))))) is different from false [2025-04-13 18:06:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:34,303 INFO L93 Difference]: Finished difference Result 200 states and 536 transitions. [2025-04-13 18:06:34,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:06:34,303 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:06:34,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:34,304 INFO L225 Difference]: With dead ends: 200 [2025-04-13 18:06:34,304 INFO L226 Difference]: Without dead ends: 191 [2025-04-13 18:06:34,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=100, Invalid=215, Unknown=7, NotChecked=140, Total=462 [2025-04-13 18:06:34,305 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:34,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 261 Unchecked, 0.4s Time] [2025-04-13 18:06:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-13 18:06:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2025-04-13 18:06:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.911949685534591) internal successors, (463), 159 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:06:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 463 transitions. [2025-04-13 18:06:34,420 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 463 transitions. Word has length 15 [2025-04-13 18:06:34,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:34,420 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 463 transitions. [2025-04-13 18:06:34,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:06:34,420 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 463 transitions. [2025-04-13 18:06:34,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:06:34,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:34,421 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:34,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:06:34,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 18:06:34,621 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:06:34,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1671406091, now seen corresponding path program 24 times [2025-04-13 18:06:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:34,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015476947] [2025-04-13 18:06:34,622 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:34,624 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:06:34,629 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:06:34,629 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:06:34,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:35,911 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:06:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:35,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015476947] [2025-04-13 18:06:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015476947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:35,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428592291] [2025-04-13 18:06:35,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:35,914 INFO L229 MonitoredProcess]: Starting monitored process 35 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:06:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:06:35,938 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:06:35,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:06:35,958 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:06:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:35,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:06:35,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:36,383 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:06:36,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:40,834 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse4 (+ .cse0 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (.cse2 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((v_z_363 Int)) (or (< (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296) (+ .cse0 .cse1 2)) (< v_z_363 .cse2) (< .cse3 v_z_363))) (forall ((v_z_363 Int)) (let ((.cse5 (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296))) (or (< .cse4 (+ .cse5 1)) (< (+ .cse5 4294967294) (+ .cse0 .cse1)) (< v_z_363 .cse2) (< .cse3 v_z_363)))) (forall ((v_z_363 Int)) (or (< .cse4 (+ (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296) 4294967297)) (< v_z_363 .cse2) (< .cse3 v_z_363)))))) is different from false [2025-04-13 18:06:44,885 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((v_z_363 Int)) (or (< .cse0 (+ (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296) 4294967295)) (< v_z_363 .cse1) (< .cse2 v_z_363))) (forall ((v_z_363 Int)) (or (< (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296) (+ .cse0 3)) (< v_z_363 .cse1) (< .cse2 v_z_363))) (forall ((v_z_363 Int)) (let ((.cse3 (mod (+ c_~x_2~0 (* 2 v_z_363)) 4294967296))) (or (< (+ .cse0 1) .cse3) (< (+ .cse3 4294967293) .cse0) (< v_z_363 .cse1) (< .cse2 v_z_363)))))) is different from false [2025-04-13 18:06:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 18:06:44,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428592291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:44,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:44,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 18:06:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515376606] [2025-04-13 18:06:44,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:44,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:06:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:44,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:06:44,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=245, Unknown=2, NotChecked=66, Total=380 [2025-04-13 18:06:44,969 INFO L87 Difference]: Start difference. First operand 160 states and 463 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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:06:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:46,142 INFO L93 Difference]: Finished difference Result 207 states and 566 transitions. [2025-04-13 18:06:46,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:06:46,142 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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 15 [2025-04-13 18:06:46,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:46,143 INFO L225 Difference]: With dead ends: 207 [2025-04-13 18:06:46,143 INFO L226 Difference]: Without dead ends: 198 [2025-04-13 18:06:46,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=113, Invalid=445, Unknown=2, NotChecked=90, Total=650 [2025-04-13 18:06:46,144 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:46,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 418 Invalid, 0 Unknown, 157 Unchecked, 0.6s Time] [2025-04-13 18:06:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-04-13 18:06:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2025-04-13 18:06:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.9760479041916166) internal successors, (497), 167 states have internal predecessors, (497), 0 states have call successors, (0), 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:06:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 497 transitions. [2025-04-13 18:06:46,262 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 497 transitions. Word has length 15 [2025-04-13 18:06:46,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:46,263 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 497 transitions. [2025-04-13 18:06:46,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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:06:46,263 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 497 transitions. [2025-04-13 18:06:46,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:06:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:46,263 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:46,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:06:46,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 18:06:46,464 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:06:46,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1772952033, now seen corresponding path program 6 times [2025-04-13 18:06:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:46,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91187755] [2025-04-13 18:06:46,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:46,466 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:06:46,469 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:06:46,469 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:06:46,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:46,556 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:06:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:46,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91187755] [2025-04-13 18:06:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91187755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:46,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20447783] [2025-04-13 18:06:46,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:46,558 INFO L229 MonitoredProcess]: Starting monitored process 36 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:06:46,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 18:06:46,579 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:06:46,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:06:46,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:06:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:46,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:06:46,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:46,681 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:06:46,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:51,328 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~x_2~0 4294967296))) (let ((.cse0 (+ .cse5 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse2 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367))) (.cse1 (+ .cse4 v_z_367))) (or (< 4294967295 v_z_367) (= .cse0 .cse1) (< .cse2 0) (< .cse3 .cse2) (< .cse1 4294967296)))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse6 (+ .cse4 v_z_367)) (.cse7 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)))) (or (< v_z_367 0) (< 4294967295 v_z_367) (= .cse5 .cse6) (= .cse0 .cse6) (< .cse7 0) (< .cse3 .cse7)))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse8 (+ .cse4 v_z_367)) (.cse9 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)))) (or (< v_z_367 0) (= .cse5 .cse8) (< .cse9 0) (< 4294967295 .cse8) (< .cse3 .cse9))))))) is different from false [2025-04-13 18:07:11,451 WARN L286 SmtUtils]: Spent 16.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:07:32,469 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_2~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse1 (+ .cse2 v_z_367))) (or (< v_z_367 0) (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0))))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse4 (+ .cse2 v_z_367))) (or (< 4294967295 v_z_367) (= .cse3 .cse4) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0)) (< .cse4 4294967296)))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse5 (+ .cse2 v_z_367))) (or (< v_z_367 0) (< 4294967295 v_z_367) (= .cse0 .cse5) (= .cse3 .cse5) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0)))))))) is different from false [2025-04-13 18:07:52,544 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:08:32,698 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:08:57,460 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:09:20,400 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:09:28,430 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:09:40,465 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:10:00,537 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:10:24,627 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:11:08,828 WARN L286 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:11:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 18:11:25,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20447783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:11:25,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:11:25,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 18:11:25,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635678008] [2025-04-13 18:11:25,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:11:25,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:11:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:25,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:11:25,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=134, Unknown=2, NotChecked=50, Total=240 [2025-04-13 18:11:25,521 INFO L87 Difference]: Start difference. First operand 168 states and 497 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:11:29,748 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_2~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse1 (+ .cse2 v_z_367))) (or (< v_z_367 0) (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0))))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse4 (+ .cse2 v_z_367))) (or (< 4294967295 v_z_367) (= .cse3 .cse4) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0)) (< .cse4 4294967296)))) (= c_~x_2~0 0) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse5 (+ .cse2 v_z_367))) (or (< v_z_367 0) (< 4294967295 v_z_367) (= .cse0 .cse5) (= .cse3 .cse5) (not (= (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)) 0))))) (= c_~x_1~0 0)))) is different from false [2025-04-13 18:11:33,973 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~x_2~0 4294967296))) (let ((.cse0 (+ .cse5 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (mod c_~x_1~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse2 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367))) (.cse1 (+ .cse4 v_z_367))) (or (< 4294967295 v_z_367) (= .cse0 .cse1) (< .cse2 0) (< .cse3 .cse2) (< .cse1 4294967296)))) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse6 (+ .cse4 v_z_367)) (.cse7 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)))) (or (< v_z_367 0) (< 4294967295 v_z_367) (= .cse5 .cse6) (= .cse0 .cse6) (< .cse7 0) (< .cse3 .cse7)))) (forall ((v_z_367 Int) (v_y_367 Int)) (let ((.cse8 (+ .cse4 v_z_367)) (.cse9 (+ (* v_y_367 4294967296) (* 2863311531 v_z_367)))) (or (< v_z_367 0) (= .cse5 .cse8) (< .cse9 0) (< 4294967295 .cse8) (< .cse3 .cse9))))))) is different from false [2025-04-13 18:11:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:34,688 INFO L93 Difference]: Finished difference Result 216 states and 587 transitions. [2025-04-13 18:11:34,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:11:34,689 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:11:34,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:34,690 INFO L225 Difference]: With dead ends: 216 [2025-04-13 18:11:34,690 INFO L226 Difference]: Without dead ends: 185 [2025-04-13 18:11:34,690 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=95, Invalid=223, Unknown=4, NotChecked=140, Total=462 [2025-04-13 18:11:34,690 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:34,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 225 Invalid, 0 Unknown, 246 Unchecked, 0.3s Time] [2025-04-13 18:11:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-13 18:11:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2025-04-13 18:11:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 2.971264367816092) internal successors, (517), 174 states have internal predecessors, (517), 0 states have call successors, (0), 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:11:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 517 transitions. [2025-04-13 18:11:34,816 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 517 transitions. Word has length 15 [2025-04-13 18:11:34,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:34,816 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 517 transitions. [2025-04-13 18:11:34,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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:11:34,816 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 517 transitions. [2025-04-13 18:11:34,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:11:34,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:34,817 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:11:34,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 18:11:35,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 18:11:35,017 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:11:35,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 705118205, now seen corresponding path program 7 times [2025-04-13 18:11:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:35,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506331447] [2025-04-13 18:11:35,018 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:11:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:35,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:11:35,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:11:35,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:11:35,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:35,112 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:11:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:35,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506331447] [2025-04-13 18:11:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506331447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:11:35,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393308717] [2025-04-13 18:11:35,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:11:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:11:35,115 INFO L229 MonitoredProcess]: Starting monitored process 37 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:11:35,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 18:11:35,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:11:35,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:11:35,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:11:35,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:35,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:11:35,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:11:35,241 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:11:35,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:11:39,921 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse3 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (+ .cse1 4294967296)) (.cse5 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse0 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296))) (.cse2 (+ .cse5 v_z_370))) (or (< v_z_370 0) (< .cse0 0) (= .cse1 .cse2) (< .cse3 .cse0) (= .cse4 .cse2) (< 4294967295 v_z_370)))) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse6 (+ .cse5 v_z_370)) (.cse7 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (or (< 4294967295 .cse6) (< v_z_370 0) (< .cse7 0) (= .cse1 .cse6) (< .cse3 .cse7)))) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse9 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296))) (.cse8 (+ .cse5 v_z_370))) (or (< .cse8 4294967296) (< .cse9 0) (< .cse3 .cse9) (= .cse4 .cse8) (< 4294967295 v_z_370))))))) is different from false [2025-04-13 18:12:16,114 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:12:28,295 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_2~0 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse1 (+ .cse3 v_z_370))) (or (< v_z_370 0) (not (= 0 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_370)))) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse4 (+ .cse3 v_z_370))) (or (< 4294967295 .cse4) (< v_z_370 0) (not (= 0 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (= .cse0 .cse4)))) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse5 (+ .cse3 v_z_370))) (or (< .cse5 4294967296) (not (= 0 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (= .cse2 .cse5) (< 4294967295 v_z_370))))))) is different from false [2025-04-13 18:13:00,776 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:13:45,192 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:14:26,573 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 18:14:34,588 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 18:15:11,386 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:15:11,387 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:15:12,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 18:15:12,587 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 18:15:12,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 18:15:12,707 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 18:15:12,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:15:12,707 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2025-04-13 18:15:12,708 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 18:15:12,708 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 18:15:12,710 INFO L422 BasicCegarLoop]: Path program histogram: [24, 7, 5, 1] [2025-04-13 18:15:12,711 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:15:12,711 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:15:12,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:15:12 BasicIcfg [2025-04-13 18:15:12,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:15:12,713 INFO L158 Benchmark]: Toolchain (without parser) took 874115.47ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 111.4MB in the beginning and 203.6MB in the end (delta: -92.3MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.66ms. Allocated memory is still 155.2MB. Free memory was 111.4MB in the beginning and 97.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.30ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: Boogie Preprocessor took 28.76ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: RCFGBuilder took 300.92ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 72.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 18:15:12,713 INFO L158 Benchmark]: TraceAbstraction took 873511.15ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 71.7MB in the beginning and 203.6MB in the end (delta: -131.9MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2025-04-13 18:15:12,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.66ms. Allocated memory is still 155.2MB. Free memory was 111.4MB in the beginning and 97.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.30ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.76ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 300.92ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 72.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 873511.15ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 71.7MB in the beginning and 203.6MB in the end (delta: -131.9MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 873.4s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 114.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 1545 SdHoareTripleChecker+Valid, 84.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1545 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 82.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 664 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12762 IncrementalHoareTripleChecker+Invalid, 13984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 0 mSDtfsCounter, 12762 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1376 GetRequests, 593 SyntacticMatches, 38 SemanticMatches, 745 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4728 ImplicationChecksByTransitivity, 101.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=36, InterpolantAutomatonStates: 630, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 1429 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 529.9s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 1385 ConstructedInterpolants, 27 QuantifiedInterpolants, 25806 SizeOfPredicates, 126 NumberOfNonLiveVariables, 3340 ConjunctsInSsa, 665 ConjunctsInUnsatCore, 106 InterpolantComputations, 1 PerfectInterpolantSequences, 1/270 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