/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:12:27,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:12:27,608 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 22:12:27,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:12:27,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:12:27,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:12:27,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:12:27,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:12:27,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:12:27,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:12:27,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:12:27,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:12:27,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:12:27,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:12:27,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:12:27,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:12:27,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:27,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:27,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:12:27,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:12:27,632 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:12:27,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:12:27,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:12:27,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:12:27,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:12:27,871 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:12:27,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 22:12:29,202 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac56f0347/b6b2dce6e12247a0a3c2c1396dc21b83/FLAGd1c3a7a8d [2025-04-13 22:12:29,389 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:12:29,390 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 22:12:29,397 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac56f0347/b6b2dce6e12247a0a3c2c1396dc21b83/FLAGd1c3a7a8d [2025-04-13 22:12:30,354 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac56f0347/b6b2dce6e12247a0a3c2c1396dc21b83 [2025-04-13 22:12:30,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:12:30,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:12:30,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:30,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:12:30,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:12:30,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6ae971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30, skipping insertion in model container [2025-04-13 22:12:30,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:12:30,562 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/chl-chromosome-subst.wvr.c[3136,3149] [2025-04-13 22:12:30,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:30,588 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:12:30,629 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/chl-chromosome-subst.wvr.c[3136,3149] [2025-04-13 22:12:30,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:30,656 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:12:30,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30 WrapperNode [2025-04-13 22:12:30,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:30,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:30,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:12:30,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:12:30,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,696 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 253 [2025-04-13 22:12:30,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:30,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:12:30,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:12:30,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:12:30,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,733 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 22:12:30,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:12:30,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:12:30,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:12:30,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:12:30,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (1/1) ... [2025-04-13 22:12:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:30,772 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 22:12:30,775 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 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:12:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:12:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:12:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:12:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:12:30,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:12:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:12:30,793 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:12:30,886 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:12:30,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:12:31,187 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:12:31,188 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:12:31,188 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:12:31,458 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:12:31,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:12:31 BoogieIcfgContainer [2025-04-13 22:12:31,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:12:31,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:12:31,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:12:31,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:12:31,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:12:30" (1/3) ... [2025-04-13 22:12:31,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff7e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:12:31, skipping insertion in model container [2025-04-13 22:12:31,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:30" (2/3) ... [2025-04-13 22:12:31,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff7e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:12:31, skipping insertion in model container [2025-04-13 22:12:31,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:12:31" (3/3) ... [2025-04-13 22:12:31,464 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-04-13 22:12:31,474 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:12:31,476 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:12:31,476 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:12:31,514 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:12:31,534 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 22:12:31,551 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:31,571 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:12:31,581 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;@14367df8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:12:31,581 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:12:31,583 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:31,587 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:12:31,587 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:31,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:31,588 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:31,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -515473634, now seen corresponding path program 1 times [2025-04-13 22:12:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:31,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969286240] [2025-04-13 22:12:31,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:31,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:12:31,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:12:31,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:31,979 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 22:12:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:31,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969286240] [2025-04-13 22:12:31,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969286240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:31,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:12:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166479471] [2025-04-13 22:12:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:31,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:12:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:32,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:12:32,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:12:32,006 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:32,103 INFO L93 Difference]: Finished difference Result 195 states and 599 transitions. [2025-04-13 22:12:32,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:12:32,106 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:12:32,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:32,113 INFO L225 Difference]: With dead ends: 195 [2025-04-13 22:12:32,113 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 22:12:32,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:12:32,120 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:32,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 22:12:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-13 22:12:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 3.04040404040404) internal successors, (301), 99 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 301 transitions. [2025-04-13 22:12:32,148 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 301 transitions. Word has length 20 [2025-04-13 22:12:32,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:32,148 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 301 transitions. [2025-04-13 22:12:32,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,149 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 301 transitions. [2025-04-13 22:12:32,149 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:12:32,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:32,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:32,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:12:32,150 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:32,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1800656019, now seen corresponding path program 1 times [2025-04-13 22:12:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:32,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100706161] [2025-04-13 22:12:32,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 22:12:32,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:12:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:12:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:32,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100706161] [2025-04-13 22:12:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100706161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:32,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:12:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211159776] [2025-04-13 22:12:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:32,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:12:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:32,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:12:32,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:12:32,374 INFO L87 Difference]: Start difference. First operand 100 states and 301 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:32,467 INFO L93 Difference]: Finished difference Result 166 states and 506 transitions. [2025-04-13 22:12:32,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:12:32,468 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:12:32,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:32,470 INFO L225 Difference]: With dead ends: 166 [2025-04-13 22:12:32,470 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 22:12:32,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:12:32,471 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:32,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 22:12:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-13 22:12:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.088) internal successors, (386), 125 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 386 transitions. [2025-04-13 22:12:32,490 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 386 transitions. Word has length 23 [2025-04-13 22:12:32,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:32,491 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 386 transitions. [2025-04-13 22:12:32,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,491 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 386 transitions. [2025-04-13 22:12:32,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:12:32,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:32,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:32,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:12:32,496 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:32,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 346403004, now seen corresponding path program 1 times [2025-04-13 22:12:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:32,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716247617] [2025-04-13 22:12:32,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:32,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:12:32,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:12:32,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:32,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:12:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:32,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716247617] [2025-04-13 22:12:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716247617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:32,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980363101] [2025-04-13 22:12:32,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:32,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:32,675 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 22:12:32,676 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 22:12:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:12:32,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:12:32,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:32,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:12:32,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:12:32,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:12:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980363101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:32,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 22:12:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438998243] [2025-04-13 22:12:32,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:32,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:12:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:32,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:12:32,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:32,832 INFO L87 Difference]: Start difference. First operand 126 states and 386 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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 22:12:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:32,931 INFO L93 Difference]: Finished difference Result 258 states and 786 transitions. [2025-04-13 22:12:32,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:12:32,932 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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 24 [2025-04-13 22:12:32,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:32,934 INFO L225 Difference]: With dead ends: 258 [2025-04-13 22:12:32,935 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 22:12:32,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:32,935 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:32,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 22:12:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-13 22:12:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9477611940298507) internal successors, (395), 134 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 395 transitions. [2025-04-13 22:12:32,974 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 395 transitions. Word has length 24 [2025-04-13 22:12:32,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:32,974 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 395 transitions. [2025-04-13 22:12:32,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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 22:12:32,974 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 395 transitions. [2025-04-13 22:12:32,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:12:32,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:32,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:32,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:12:33,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:33,183 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:33,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1949639087, now seen corresponding path program 2 times [2025-04-13 22:12:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:33,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027649669] [2025-04-13 22:12:33,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:33,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:12:33,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 22:12:33,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:12:33,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:12:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:33,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027649669] [2025-04-13 22:12:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027649669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:33,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842811290] [2025-04-13 22:12:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:33,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:33,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:33,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:12:33,520 INFO L87 Difference]: Start difference. First operand 135 states and 395 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:33,677 INFO L93 Difference]: Finished difference Result 250 states and 767 transitions. [2025-04-13 22:12:33,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:12:33,677 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:12:33,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:33,679 INFO L225 Difference]: With dead ends: 250 [2025-04-13 22:12:33,679 INFO L226 Difference]: Without dead ends: 238 [2025-04-13 22:12:33,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:33,680 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:33,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-04-13 22:12:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2025-04-13 22:12:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.0558375634517767) internal successors, (602), 197 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 602 transitions. [2025-04-13 22:12:33,694 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 602 transitions. Word has length 33 [2025-04-13 22:12:33,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:33,694 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 602 transitions. [2025-04-13 22:12:33,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,695 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 602 transitions. [2025-04-13 22:12:33,695 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:12:33,695 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:33,696 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:33,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:12:33,696 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:33,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 673458463, now seen corresponding path program 3 times [2025-04-13 22:12:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:33,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470610567] [2025-04-13 22:12:33,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:33,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-04-13 22:12:33,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 22:12:33,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:12:33,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:12:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:34,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470610567] [2025-04-13 22:12:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470610567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31112192] [2025-04-13 22:12:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:34,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:34,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:12:34,100 INFO L87 Difference]: Start difference. First operand 198 states and 602 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:34,279 INFO L93 Difference]: Finished difference Result 308 states and 940 transitions. [2025-04-13 22:12:34,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:34,279 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:12:34,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:34,282 INFO L225 Difference]: With dead ends: 308 [2025-04-13 22:12:34,282 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 22:12:34,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:34,282 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:34,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 22:12:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 216. [2025-04-13 22:12:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.213953488372093) internal successors, (691), 215 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 691 transitions. [2025-04-13 22:12:34,307 INFO L79 Accepts]: Start accepts. Automaton has 216 states and 691 transitions. Word has length 33 [2025-04-13 22:12:34,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:34,307 INFO L485 AbstractCegarLoop]: Abstraction has 216 states and 691 transitions. [2025-04-13 22:12:34,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,307 INFO L278 IsEmpty]: Start isEmpty. Operand 216 states and 691 transitions. [2025-04-13 22:12:34,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:12:34,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:34,308 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:34,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:12:34,309 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:34,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 675880183, now seen corresponding path program 4 times [2025-04-13 22:12:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:34,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858446987] [2025-04-13 22:12:34,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:34,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:12:34,337 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:12:34,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:12:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:12:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:34,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858446987] [2025-04-13 22:12:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858446987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:34,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998317943] [2025-04-13 22:12:34,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:34,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:34,486 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 22:12:34,488 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 22:12:34,561 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:12:34,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:12:34,605 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:12:34,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:34,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:12:34,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:12:34,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:12:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998317943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:34,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 22:12:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585065796] [2025-04-13 22:12:34,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:34,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:12:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:34,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:12:34,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:12:34,757 INFO L87 Difference]: Start difference. First operand 216 states and 691 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:34,895 INFO L93 Difference]: Finished difference Result 429 states and 1381 transitions. [2025-04-13 22:12:34,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:34,896 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:12:34,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:34,897 INFO L225 Difference]: With dead ends: 429 [2025-04-13 22:12:34,897 INFO L226 Difference]: Without dead ends: 219 [2025-04-13 22:12:34,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:12:34,898 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:34,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-13 22:12:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-04-13 22:12:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 3.18348623853211) internal successors, (694), 218 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 694 transitions. [2025-04-13 22:12:34,923 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 694 transitions. Word has length 33 [2025-04-13 22:12:34,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:34,924 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 694 transitions. [2025-04-13 22:12:34,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,924 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 694 transitions. [2025-04-13 22:12:34,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:12:34,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:34,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:34,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:35,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:12:35,125 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:35,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash -739282526, now seen corresponding path program 5 times [2025-04-13 22:12:35,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:35,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579608753] [2025-04-13 22:12:35,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:35,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:35,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-04-13 22:12:35,179 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:12:35,184 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:12:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:35,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579608753] [2025-04-13 22:12:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579608753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:35,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155523087] [2025-04-13 22:12:35,369 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:35,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:35,371 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 22:12:35,373 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 22:12:35,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-04-13 22:12:35,697 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:12:35,697 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:35,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:12:35,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:35,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:12:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155523087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:35,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:12:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-04-13 22:12:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46308557] [2025-04-13 22:12:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:35,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:35,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:35,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:35,774 INFO L87 Difference]: Start difference. First operand 219 states and 694 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:35,868 INFO L93 Difference]: Finished difference Result 299 states and 917 transitions. [2025-04-13 22:12:35,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:12:35,869 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:12:35,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:35,871 INFO L225 Difference]: With dead ends: 299 [2025-04-13 22:12:35,872 INFO L226 Difference]: Without dead ends: 287 [2025-04-13 22:12:35,872 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:35,875 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:35,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-04-13 22:12:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 219. [2025-04-13 22:12:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 3.0596330275229358) internal successors, (667), 218 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 667 transitions. [2025-04-13 22:12:35,892 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 667 transitions. Word has length 36 [2025-04-13 22:12:35,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:35,892 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 667 transitions. [2025-04-13 22:12:35,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,892 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 667 transitions. [2025-04-13 22:12:35,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:35,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:35,893 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:35,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:36,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:36,094 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:36,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1229616485, now seen corresponding path program 1 times [2025-04-13 22:12:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:36,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623087300] [2025-04-13 22:12:36,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:36,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:12:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:36,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:36,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:36,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623087300] [2025-04-13 22:12:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623087300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189645422] [2025-04-13 22:12:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:36,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:12:36,332 INFO L87 Difference]: Start difference. First operand 219 states and 667 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:36,490 INFO L93 Difference]: Finished difference Result 291 states and 871 transitions. [2025-04-13 22:12:36,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:36,490 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:36,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:36,492 INFO L225 Difference]: With dead ends: 291 [2025-04-13 22:12:36,492 INFO L226 Difference]: Without dead ends: 241 [2025-04-13 22:12:36,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:36,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:36,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-13 22:12:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2025-04-13 22:12:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 3.05) internal successors, (610), 200 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 610 transitions. [2025-04-13 22:12:36,506 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 610 transitions. Word has length 37 [2025-04-13 22:12:36,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:36,506 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 610 transitions. [2025-04-13 22:12:36,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,506 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 610 transitions. [2025-04-13 22:12:36,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:36,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:36,507 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:36,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:12:36,507 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:36,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -676486988, now seen corresponding path program 1 times [2025-04-13 22:12:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:36,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402714323] [2025-04-13 22:12:36,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:12:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:36,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:36,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:36,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:36,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402714323] [2025-04-13 22:12:36,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402714323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:36,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029388871] [2025-04-13 22:12:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:36,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:36,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:36,707 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 22:12:36,708 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 22:12:36,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:12:36,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:36,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:12:36,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:12:36,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029388871] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:12:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 8] total 13 [2025-04-13 22:12:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107364934] [2025-04-13 22:12:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:37,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:37,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:37,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:37,016 INFO L87 Difference]: Start difference. First operand 201 states and 610 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:37,184 INFO L93 Difference]: Finished difference Result 333 states and 1030 transitions. [2025-04-13 22:12:37,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:12:37,184 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:37,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:37,186 INFO L225 Difference]: With dead ends: 333 [2025-04-13 22:12:37,187 INFO L226 Difference]: Without dead ends: 324 [2025-04-13 22:12:37,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:12:37,187 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:37,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-13 22:12:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 220. [2025-04-13 22:12:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 3.009132420091324) internal successors, (659), 219 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 659 transitions. [2025-04-13 22:12:37,205 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 659 transitions. Word has length 37 [2025-04-13 22:12:37,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:37,206 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 659 transitions. [2025-04-13 22:12:37,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,206 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 659 transitions. [2025-04-13 22:12:37,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:37,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:37,206 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:37,213 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 22:12:37,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:37,407 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:37,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash 211076275, now seen corresponding path program 2 times [2025-04-13 22:12:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:37,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919148748] [2025-04-13 22:12:37,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:37,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:37,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:37,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:37,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:37,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919148748] [2025-04-13 22:12:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919148748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:37,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355151171] [2025-04-13 22:12:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:37,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:37,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:37,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:12:37,688 INFO L87 Difference]: Start difference. First operand 220 states and 659 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:37,867 INFO L93 Difference]: Finished difference Result 354 states and 1071 transitions. [2025-04-13 22:12:37,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:37,867 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:37,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:37,871 INFO L225 Difference]: With dead ends: 354 [2025-04-13 22:12:37,871 INFO L226 Difference]: Without dead ends: 322 [2025-04-13 22:12:37,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:37,872 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:37,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-13 22:12:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 248. [2025-04-13 22:12:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 3.125506072874494) internal successors, (772), 247 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 772 transitions. [2025-04-13 22:12:37,898 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 772 transitions. Word has length 37 [2025-04-13 22:12:37,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:37,899 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 772 transitions. [2025-04-13 22:12:37,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,900 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 772 transitions. [2025-04-13 22:12:37,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:37,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:37,900 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:37,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:12:37,900 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:37,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash 228861502, now seen corresponding path program 2 times [2025-04-13 22:12:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:37,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062439578] [2025-04-13 22:12:37,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:37,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:37,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:37,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:37,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:38,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062439578] [2025-04-13 22:12:38,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062439578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:38,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699783309] [2025-04-13 22:12:38,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:38,101 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 22:12:38,103 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 22:12:38,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:38,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:38,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:38,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:12:38,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:38,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699783309] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:12:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2025-04-13 22:12:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781039276] [2025-04-13 22:12:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:38,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:38,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:38,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:38,360 INFO L87 Difference]: Start difference. First operand 248 states and 772 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:38,527 INFO L93 Difference]: Finished difference Result 369 states and 1126 transitions. [2025-04-13 22:12:38,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:38,528 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:38,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:38,530 INFO L225 Difference]: With dead ends: 369 [2025-04-13 22:12:38,530 INFO L226 Difference]: Without dead ends: 348 [2025-04-13 22:12:38,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:38,531 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:38,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-04-13 22:12:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 263. [2025-04-13 22:12:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2442748091603053) internal successors, (850), 262 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 850 transitions. [2025-04-13 22:12:38,554 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 850 transitions. Word has length 37 [2025-04-13 22:12:38,554 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:38,554 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 850 transitions. [2025-04-13 22:12:38,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,555 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 850 transitions. [2025-04-13 22:12:38,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:38,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:38,555 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:38,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:12:38,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 22:12:38,756 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:38,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 286694482, now seen corresponding path program 3 times [2025-04-13 22:12:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:38,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335759662] [2025-04-13 22:12:38,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:38,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:38,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 22:12:38,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:38,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:38,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:38,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335759662] [2025-04-13 22:12:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335759662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:38,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099968021] [2025-04-13 22:12:38,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:38,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:38,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:38,914 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 22:12:38,916 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 22:12:38,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:39,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 22:12:39,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:39,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:39,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:12:39,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:39,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:12:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099968021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:12:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-04-13 22:12:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534497643] [2025-04-13 22:12:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:39,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:39,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:39,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:39,095 INFO L87 Difference]: Start difference. First operand 263 states and 850 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:39,256 INFO L93 Difference]: Finished difference Result 343 states and 1073 transitions. [2025-04-13 22:12:39,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:39,256 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:39,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:39,258 INFO L225 Difference]: With dead ends: 343 [2025-04-13 22:12:39,258 INFO L226 Difference]: Without dead ends: 313 [2025-04-13 22:12:39,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:12:39,259 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:39,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-13 22:12:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 263. [2025-04-13 22:12:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2099236641221376) internal successors, (841), 262 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 841 transitions. [2025-04-13 22:12:39,292 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 841 transitions. Word has length 37 [2025-04-13 22:12:39,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:39,292 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 841 transitions. [2025-04-13 22:12:39,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,292 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 841 transitions. [2025-04-13 22:12:39,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:39,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:39,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:39,301 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 22:12:39,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:39,495 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:39,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash 314748955, now seen corresponding path program 3 times [2025-04-13 22:12:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:39,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145185010] [2025-04-13 22:12:39,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:39,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:39,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 22:12:39,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:39,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145185010] [2025-04-13 22:12:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145185010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:39,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997254685] [2025-04-13 22:12:39,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:39,650 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 22:12:39,652 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 22:12:39,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:39,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 22:12:39,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:39,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:12:39,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:39,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997254685] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:12:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2025-04-13 22:12:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834741718] [2025-04-13 22:12:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:39,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:39,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:39,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:39,890 INFO L87 Difference]: Start difference. First operand 263 states and 841 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:40,041 INFO L93 Difference]: Finished difference Result 334 states and 1042 transitions. [2025-04-13 22:12:40,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:40,041 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:40,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:40,043 INFO L225 Difference]: With dead ends: 334 [2025-04-13 22:12:40,043 INFO L226 Difference]: Without dead ends: 312 [2025-04-13 22:12:40,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:40,045 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:40,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-13 22:12:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2025-04-13 22:12:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.2063492063492065) internal successors, (808), 252 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 808 transitions. [2025-04-13 22:12:40,069 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 808 transitions. Word has length 37 [2025-04-13 22:12:40,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:40,070 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 808 transitions. [2025-04-13 22:12:40,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,070 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 808 transitions. [2025-04-13 22:12:40,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:40,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:40,071 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:40,078 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 22:12:40,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:40,277 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:40,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1517971059, now seen corresponding path program 4 times [2025-04-13 22:12:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:40,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402006180] [2025-04-13 22:12:40,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:40,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:40,299 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:40,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:12:40,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:40,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402006180] [2025-04-13 22:12:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402006180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028818379] [2025-04-13 22:12:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:40,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:40,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:40,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:12:40,459 INFO L87 Difference]: Start difference. First operand 253 states and 808 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:40,616 INFO L93 Difference]: Finished difference Result 334 states and 1034 transitions. [2025-04-13 22:12:40,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:40,616 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:40,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:40,618 INFO L225 Difference]: With dead ends: 334 [2025-04-13 22:12:40,618 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 22:12:40,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:40,618 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:40,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 22:12:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 253. [2025-04-13 22:12:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.1706349206349205) internal successors, (799), 252 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 799 transitions. [2025-04-13 22:12:40,641 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 799 transitions. Word has length 37 [2025-04-13 22:12:40,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:40,642 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 799 transitions. [2025-04-13 22:12:40,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:40,642 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 799 transitions. [2025-04-13 22:12:40,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:40,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:40,642 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:40,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:12:40,643 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:40,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1500185832, now seen corresponding path program 4 times [2025-04-13 22:12:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:40,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172037850] [2025-04-13 22:12:40,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:40,653 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:40,671 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:40,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:12:40,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:40,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172037850] [2025-04-13 22:12:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172037850] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:40,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462749417] [2025-04-13 22:12:40,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:40,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:40,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:40,841 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 22:12:40,842 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 22:12:40,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:12:40,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:40,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:12:40,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:40,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:12:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:41,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462749417] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:12:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 12 [2025-04-13 22:12:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448415790] [2025-04-13 22:12:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:41,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:41,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:41,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:41,121 INFO L87 Difference]: Start difference. First operand 253 states and 799 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:41,284 INFO L93 Difference]: Finished difference Result 354 states and 1079 transitions. [2025-04-13 22:12:41,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:41,285 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:41,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:41,287 INFO L225 Difference]: With dead ends: 354 [2025-04-13 22:12:41,287 INFO L226 Difference]: Without dead ends: 333 [2025-04-13 22:12:41,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:41,287 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:41,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-13 22:12:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 253. [2025-04-13 22:12:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.1706349206349205) internal successors, (799), 252 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 799 transitions. [2025-04-13 22:12:41,323 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 799 transitions. Word has length 37 [2025-04-13 22:12:41,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:41,323 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 799 transitions. [2025-04-13 22:12:41,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:41,323 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 799 transitions. [2025-04-13 22:12:41,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:41,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:41,324 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:41,331 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 22:12:41,524 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,SelfDestructingSolverStorable14 [2025-04-13 22:12:41,524 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:41,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1442352852, now seen corresponding path program 5 times [2025-04-13 22:12:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:41,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202522405] [2025-04-13 22:12:41,525 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:41,538 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:41,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:41,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:41,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:41,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202522405] [2025-04-13 22:12:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202522405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:41,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520404812] [2025-04-13 22:12:41,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:41,689 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 22:12:41,690 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 22:12:41,778 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:42,072 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:42,073 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:42,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:42,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:12:42,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:42,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:12:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520404812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:42,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:12:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2025-04-13 22:12:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969691441] [2025-04-13 22:12:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:42,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:42,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:42,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:42,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:42,171 INFO L87 Difference]: Start difference. First operand 253 states and 799 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:42,342 INFO L93 Difference]: Finished difference Result 323 states and 971 transitions. [2025-04-13 22:12:42,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:12:42,343 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:42,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:42,345 INFO L225 Difference]: With dead ends: 323 [2025-04-13 22:12:42,345 INFO L226 Difference]: Without dead ends: 293 [2025-04-13 22:12:42,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:42,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:42,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-13 22:12:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 253. [2025-04-13 22:12:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.134920634920635) internal successors, (790), 252 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 790 transitions. [2025-04-13 22:12:42,372 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 790 transitions. Word has length 37 [2025-04-13 22:12:42,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:42,372 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 790 transitions. [2025-04-13 22:12:42,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,372 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 790 transitions. [2025-04-13 22:12:42,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:42,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:42,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:42,380 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 22:12:42,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:12:42,573 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:42,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1414298379, now seen corresponding path program 5 times [2025-04-13 22:12:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:42,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315393868] [2025-04-13 22:12:42,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:42,585 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:42,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:42,599 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:42,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:42,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315393868] [2025-04-13 22:12:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315393868] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:42,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612821413] [2025-04-13 22:12:42,732 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:42,734 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 22:12:42,736 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 22:12:42,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:43,129 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:43,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:43,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:43,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:12:43,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:43,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612821413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:43,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:43,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-04-13 22:12:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544086667] [2025-04-13 22:12:43,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:43,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:12:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:43,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:12:43,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:43,319 INFO L87 Difference]: Start difference. First operand 253 states and 790 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:43,792 INFO L93 Difference]: Finished difference Result 474 states and 1441 transitions. [2025-04-13 22:12:43,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:12:43,792 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:43,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:43,795 INFO L225 Difference]: With dead ends: 474 [2025-04-13 22:12:43,795 INFO L226 Difference]: Without dead ends: 452 [2025-04-13 22:12:43,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:12:43,796 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:43,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:12:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-04-13 22:12:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 253. [2025-04-13 22:12:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.2063492063492065) internal successors, (808), 252 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 808 transitions. [2025-04-13 22:12:43,836 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 808 transitions. Word has length 37 [2025-04-13 22:12:43,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:43,837 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 808 transitions. [2025-04-13 22:12:43,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:43,837 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 808 transitions. [2025-04-13 22:12:43,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:43,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:43,838 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:43,846 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 22:12:44,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 22:12:44,039 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:44,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:44,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1993145268, now seen corresponding path program 6 times [2025-04-13 22:12:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:44,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263069945] [2025-04-13 22:12:44,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:44,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:44,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 22:12:44,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:44,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263069945] [2025-04-13 22:12:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263069945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:44,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685562019] [2025-04-13 22:12:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:44,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:44,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:44,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:12:44,240 INFO L87 Difference]: Start difference. First operand 253 states and 808 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:44,415 INFO L93 Difference]: Finished difference Result 314 states and 958 transitions. [2025-04-13 22:12:44,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:44,415 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:44,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:44,417 INFO L225 Difference]: With dead ends: 314 [2025-04-13 22:12:44,417 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:12:44,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:44,417 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:44,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:12:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 244. [2025-04-13 22:12:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.197530864197531) internal successors, (777), 243 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 777 transitions. [2025-04-13 22:12:44,449 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 777 transitions. Word has length 37 [2025-04-13 22:12:44,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:44,449 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 777 transitions. [2025-04-13 22:12:44,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,449 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 777 transitions. [2025-04-13 22:12:44,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:44,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:44,450 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:44,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:12:44,450 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:44,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1414893025, now seen corresponding path program 6 times [2025-04-13 22:12:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:44,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386971203] [2025-04-13 22:12:44,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:44,461 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:44,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 22:12:44,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:44,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386971203] [2025-04-13 22:12:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386971203] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:44,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6731634] [2025-04-13 22:12:44,586 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:44,588 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 22:12:44,589 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 22:12:44,687 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 22:12:44,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 22:12:44,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:44,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:12:44,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:44,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:44,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6731634] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:44,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:12:44,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 10 [2025-04-13 22:12:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389290679] [2025-04-13 22:12:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:44,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:44,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:44,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:44,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:12:44,795 INFO L87 Difference]: Start difference. First operand 244 states and 777 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:44,960 INFO L93 Difference]: Finished difference Result 324 states and 1001 transitions. [2025-04-13 22:12:44,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:44,961 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:44,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:44,962 INFO L225 Difference]: With dead ends: 324 [2025-04-13 22:12:44,962 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 22:12:44,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:44,963 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:44,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 22:12:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 235. [2025-04-13 22:12:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.111111111111111) internal successors, (728), 234 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 728 transitions. [2025-04-13 22:12:44,994 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 728 transitions. Word has length 37 [2025-04-13 22:12:44,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:44,994 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 728 transitions. [2025-04-13 22:12:44,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:44,994 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 728 transitions. [2025-04-13 22:12:44,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:12:44,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:44,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:45,001 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 22:12:45,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:45,196 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:45,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash 709494548, now seen corresponding path program 7 times [2025-04-13 22:12:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:45,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680893908] [2025-04-13 22:12:45,196 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:12:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:12:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:45,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:45,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:45,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680893908] [2025-04-13 22:12:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680893908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:45,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623498790] [2025-04-13 22:12:45,366 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:12:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:45,368 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 22:12:45,369 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 22:12:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:12:45,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:12:45,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:45,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:45,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:12:45,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:45,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:12:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623498790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:45,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2025-04-13 22:12:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135848315] [2025-04-13 22:12:45,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:45,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:12:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:12:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:12:45,741 INFO L87 Difference]: Start difference. First operand 235 states and 728 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:46,059 INFO L93 Difference]: Finished difference Result 416 states and 1306 transitions. [2025-04-13 22:12:46,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:12:46,060 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:12:46,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:46,062 INFO L225 Difference]: With dead ends: 416 [2025-04-13 22:12:46,062 INFO L226 Difference]: Without dead ends: 395 [2025-04-13 22:12:46,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:12:46,063 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:46,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:12:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-13 22:12:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 210. [2025-04-13 22:12:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.0669856459330145) internal successors, (641), 209 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions. [2025-04-13 22:12:46,096 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 37 [2025-04-13 22:12:46,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:46,096 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 641 transitions. [2025-04-13 22:12:46,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,096 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions. [2025-04-13 22:12:46,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:12:46,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:46,097 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:46,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 22:12:46,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:46,298 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:12:46,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 503763939, now seen corresponding path program 1 times [2025-04-13 22:12:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:46,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307277813] [2025-04-13 22:12:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:46,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:12:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:12:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:12:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:46,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307277813] [2025-04-13 22:12:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307277813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:46,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022590390] [2025-04-13 22:12:46,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:46,438 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 22:12:46,439 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 22:12:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:12:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:12:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:46,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:12:46,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:46,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:46,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2025-04-13 22:12:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:12:46,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:00,407 INFO L325 Elim1Store]: treesize reduction 28, result has 94.9 percent of original size [2025-04-13 22:13:00,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 210 treesize of output 583 [2025-04-13 22:13:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:13:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022590390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:41,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2025-04-13 22:13:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332306990] [2025-04-13 22:13:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:41,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:41,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:41,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=349, Unknown=3, NotChecked=0, Total=420 [2025-04-13 22:13:41,766 INFO L87 Difference]: Start difference. First operand 210 states and 641 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:43,069 INFO L93 Difference]: Finished difference Result 427 states and 1339 transitions. [2025-04-13 22:13:43,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:13:43,069 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 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 38 [2025-04-13 22:13:43,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:43,071 INFO L225 Difference]: With dead ends: 427 [2025-04-13 22:13:43,071 INFO L226 Difference]: Without dead ends: 294 [2025-04-13 22:13:43,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=261, Invalid=858, Unknown=3, NotChecked=0, Total=1122 [2025-04-13 22:13:43,072 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:43,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:13:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-13 22:13:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 252. [2025-04-13 22:13:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.1115537848605577) internal successors, (781), 251 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 781 transitions. [2025-04-13 22:13:43,115 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 781 transitions. Word has length 38 [2025-04-13 22:13:43,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:43,115 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 781 transitions. [2025-04-13 22:13:43,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:43,115 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 781 transitions. [2025-04-13 22:13:43,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:13:43,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:43,115 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:43,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:43,316 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,SelfDestructingSolverStorable20 [2025-04-13 22:13:43,316 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:13:43,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1916764518, now seen corresponding path program 2 times [2025-04-13 22:13:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:43,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310128524] [2025-04-13 22:13:43,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:43,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:13:43,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:13:43,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:13:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:43,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310128524] [2025-04-13 22:13:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310128524] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:43,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296008353] [2025-04-13 22:13:43,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:43,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:43,485 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 22:13:43,486 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 22:13:43,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:13:43,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:13:43,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:43,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:13:43,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:43,965 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:13:43,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:13:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:13:44,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:44,808 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:13:44,808 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:13:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:13:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296008353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:45,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 10] total 27 [2025-04-13 22:13:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438396170] [2025-04-13 22:13:45,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:45,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:13:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:45,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:13:45,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:45,152 INFO L87 Difference]: Start difference. First operand 252 states and 781 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:47,668 INFO L93 Difference]: Finished difference Result 581 states and 1839 transitions. [2025-04-13 22:13:47,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:13:47,669 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 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 39 [2025-04-13 22:13:47,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:47,671 INFO L225 Difference]: With dead ends: 581 [2025-04-13 22:13:47,671 INFO L226 Difference]: Without dead ends: 439 [2025-04-13 22:13:47,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=557, Invalid=2983, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:13:47,673 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 524 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:47,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 0 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:13:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-13 22:13:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 356. [2025-04-13 22:13:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 3.202816901408451) internal successors, (1137), 355 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1137 transitions. [2025-04-13 22:13:47,751 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 1137 transitions. Word has length 39 [2025-04-13 22:13:47,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:47,751 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 1137 transitions. [2025-04-13 22:13:47,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,751 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 1137 transitions. [2025-04-13 22:13:47,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:13:47,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:47,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:47,760 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 22:13:47,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:47,953 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:13:47,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1642703239, now seen corresponding path program 3 times [2025-04-13 22:13:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:47,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189599349] [2025-04-13 22:13:47,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:47,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-04-13 22:13:48,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 40 statements. [2025-04-13 22:13:48,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:13:48,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:13:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:48,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189599349] [2025-04-13 22:13:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189599349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:48,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703386909] [2025-04-13 22:13:48,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:48,309 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 22:13:48,310 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 22:13:48,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-04-13 22:13:48,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 40 statements. [2025-04-13 22:13:48,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:13:48,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:48,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:13:48,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:13:48,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:13:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703386909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:48,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 22:13:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120282323] [2025-04-13 22:13:48,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:48,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:13:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:48,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:13:48,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:13:48,650 INFO L87 Difference]: Start difference. First operand 356 states and 1137 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:49,255 INFO L93 Difference]: Finished difference Result 730 states and 2337 transitions. [2025-04-13 22:13:49,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:49,256 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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 40 [2025-04-13 22:13:49,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:49,259 INFO L225 Difference]: With dead ends: 730 [2025-04-13 22:13:49,259 INFO L226 Difference]: Without dead ends: 551 [2025-04-13 22:13:49,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:49,259 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:49,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-13 22:13:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 446. [2025-04-13 22:13:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.2269662921348314) internal successors, (1436), 445 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1436 transitions. [2025-04-13 22:13:49,357 INFO L79 Accepts]: Start accepts. Automaton has 446 states and 1436 transitions. Word has length 40 [2025-04-13 22:13:49,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:49,357 INFO L485 AbstractCegarLoop]: Abstraction has 446 states and 1436 transitions. [2025-04-13 22:13:49,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,357 INFO L278 IsEmpty]: Start isEmpty. Operand 446 states and 1436 transitions. [2025-04-13 22:13:49,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:13:49,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:49,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:49,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:49,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:49,558 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:13:49,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash -19544016, now seen corresponding path program 4 times [2025-04-13 22:13:49,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:49,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360375230] [2025-04-13 22:13:49,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:49,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:13:49,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:13:49,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:49,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:13:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:49,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360375230] [2025-04-13 22:13:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360375230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:49,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172253848] [2025-04-13 22:13:49,788 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:49,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:49,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:49,789 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 22:13:49,790 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 22:13:49,906 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:13:49,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:13:49,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:49,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:13:49,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:50,135 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 22:13:50,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 22:13:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:13:50,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:27,279 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:14:27,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:14:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:14:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172253848] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:27,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-04-13 22:14:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436518271] [2025-04-13 22:14:27,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:27,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:14:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:27,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:14:27,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=514, Unknown=9, NotChecked=0, Total=600 [2025-04-13 22:14:27,980 INFO L87 Difference]: Start difference. First operand 446 states and 1436 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:31,339 INFO L93 Difference]: Finished difference Result 774 states and 2513 transitions. [2025-04-13 22:14:31,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 22:14:31,339 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 22:14:31,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:31,342 INFO L225 Difference]: With dead ends: 774 [2025-04-13 22:14:31,343 INFO L226 Difference]: Without dead ends: 599 [2025-04-13 22:14:31,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=900, Invalid=5571, Unknown=9, NotChecked=0, Total=6480 [2025-04-13 22:14:31,344 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 679 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:31,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 0 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:14:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-04-13 22:14:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2025-04-13 22:14:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.2874015748031495) internal successors, (1670), 508 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1670 transitions. [2025-04-13 22:14:31,480 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1670 transitions. Word has length 41 [2025-04-13 22:14:31,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:31,481 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1670 transitions. [2025-04-13 22:14:31,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:31,481 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1670 transitions. [2025-04-13 22:14:31,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:14:31,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:31,482 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:31,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:14:31,682 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,SelfDestructingSolverStorable23 [2025-04-13 22:14:31,682 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:14:31,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:31,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1551933247, now seen corresponding path program 5 times [2025-04-13 22:14:31,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:31,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327310764] [2025-04-13 22:14:31,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:31,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:14:31,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:31,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:14:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:32,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327310764] [2025-04-13 22:14:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327310764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:32,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525048227] [2025-04-13 22:14:32,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:32,932 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 22:14:32,932 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 22:14:33,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:14:33,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:33,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:33,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:33,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:14:33,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:33,941 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 22:14:33,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:14:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:14:34,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:34,952 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:14:34,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:14:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:14:35,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525048227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:35,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:35,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 37 [2025-04-13 22:14:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882824787] [2025-04-13 22:14:35,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:35,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:14:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:35,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:14:35,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:14:35,108 INFO L87 Difference]: Start difference. First operand 509 states and 1670 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:36,997 INFO L93 Difference]: Finished difference Result 590 states and 1942 transitions. [2025-04-13 22:14:36,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:14:36,998 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 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 42 [2025-04-13 22:14:36,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:37,001 INFO L225 Difference]: With dead ends: 590 [2025-04-13 22:14:37,001 INFO L226 Difference]: Without dead ends: 576 [2025-04-13 22:14:37,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=3021, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:14:37,002 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 458 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:37,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 0 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:14:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-04-13 22:14:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 509. [2025-04-13 22:14:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.2874015748031495) internal successors, (1670), 508 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1670 transitions. [2025-04-13 22:14:37,137 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1670 transitions. Word has length 42 [2025-04-13 22:14:37,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:37,137 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1670 transitions. [2025-04-13 22:14:37,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,138 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1670 transitions. [2025-04-13 22:14:37,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:14:37,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:37,139 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:37,149 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 22:14:37,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:37,339 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:14:37,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1024690343, now seen corresponding path program 6 times [2025-04-13 22:14:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:37,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206190657] [2025-04-13 22:14:37,340 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:37,349 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:14:37,400 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:37,400 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:37,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:14:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:38,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206190657] [2025-04-13 22:14:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206190657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:38,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845294527] [2025-04-13 22:14:38,446 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:38,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:38,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:38,448 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 22:14:38,450 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 22:14:38,582 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:14:38,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:38,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:14:38,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:38,983 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:14:38,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:14:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:14:39,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:40,525 INFO L325 Elim1Store]: treesize reduction 28, result has 93.2 percent of original size [2025-04-13 22:14:40,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 204 treesize of output 440 [2025-04-13 22:14:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:14:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845294527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:41,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 31 [2025-04-13 22:14:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818736204] [2025-04-13 22:14:41,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:41,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:14:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:41,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:14:41,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:14:41,247 INFO L87 Difference]: Start difference. First operand 509 states and 1670 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:43,147 INFO L93 Difference]: Finished difference Result 648 states and 2116 transitions. [2025-04-13 22:14:43,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:14:43,148 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 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 42 [2025-04-13 22:14:43,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:43,151 INFO L225 Difference]: With dead ends: 648 [2025-04-13 22:14:43,151 INFO L226 Difference]: Without dead ends: 597 [2025-04-13 22:14:43,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=377, Invalid=2173, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:14:43,152 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:43,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 0 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:14:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-04-13 22:14:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 542. [2025-04-13 22:14:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.3179297597042514) internal successors, (1795), 541 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1795 transitions. [2025-04-13 22:14:43,295 INFO L79 Accepts]: Start accepts. Automaton has 542 states and 1795 transitions. Word has length 42 [2025-04-13 22:14:43,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:43,295 INFO L485 AbstractCegarLoop]: Abstraction has 542 states and 1795 transitions. [2025-04-13 22:14:43,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:43,295 INFO L278 IsEmpty]: Start isEmpty. Operand 542 states and 1795 transitions. [2025-04-13 22:14:43,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:14:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:43,296 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:43,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 22:14:43,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:43,497 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:14:43,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 578501567, now seen corresponding path program 7 times [2025-04-13 22:14:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:43,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225204215] [2025-04-13 22:14:43,497 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:43,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:14:43,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:14:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:44,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225204215] [2025-04-13 22:14:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225204215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:44,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803143349] [2025-04-13 22:14:44,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:44,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:44,656 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 22:14:44,657 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 22:14:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:14:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:14:44,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:14:44,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:45,026 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 22:14:45,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 36 [2025-04-13 22:14:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:14:45,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:14,229 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:15:14,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:15:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803143349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:15,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 30 [2025-04-13 22:15:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911927005] [2025-04-13 22:15:15,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:15,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:15:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:15,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:15:15,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=808, Unknown=7, NotChecked=0, Total=930 [2025-04-13 22:15:15,535 INFO L87 Difference]: Start difference. First operand 542 states and 1795 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:17,393 INFO L93 Difference]: Finished difference Result 753 states and 2481 transitions. [2025-04-13 22:15:17,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:15:17,394 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 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 42 [2025-04-13 22:15:17,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:17,397 INFO L225 Difference]: With dead ends: 753 [2025-04-13 22:15:17,397 INFO L226 Difference]: Without dead ends: 677 [2025-04-13 22:15:17,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=299, Invalid=1856, Unknown=7, NotChecked=0, Total=2162 [2025-04-13 22:15:17,398 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:17,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:15:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-04-13 22:15:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 575. [2025-04-13 22:15:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 3.3257839721254356) internal successors, (1909), 574 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1909 transitions. [2025-04-13 22:15:17,573 INFO L79 Accepts]: Start accepts. Automaton has 575 states and 1909 transitions. Word has length 42 [2025-04-13 22:15:17,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:17,573 INFO L485 AbstractCegarLoop]: Abstraction has 575 states and 1909 transitions. [2025-04-13 22:15:17,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,573 INFO L278 IsEmpty]: Start isEmpty. Operand 575 states and 1909 transitions. [2025-04-13 22:15:17,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:15:17,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:17,574 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:17,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 22:15:17,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:17,775 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:15:17,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 682174247, now seen corresponding path program 8 times [2025-04-13 22:15:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:17,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763863466] [2025-04-13 22:15:17,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:17,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:15:17,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:17,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:17,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:18,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763863466] [2025-04-13 22:15:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763863466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:18,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420739332] [2025-04-13 22:15:18,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:18,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:18,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:18,796 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 22:15:18,797 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 22:15:18,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:15:18,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:18,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:18,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:15:18,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:19,267 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:15:19,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:15:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:19,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:20,255 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:15:20,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:15:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420739332] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:20,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:20,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2025-04-13 22:15:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986103320] [2025-04-13 22:15:20,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:20,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:15:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:20,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:15:20,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:20,808 INFO L87 Difference]: Start difference. First operand 575 states and 1909 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:22,692 INFO L93 Difference]: Finished difference Result 682 states and 2243 transitions. [2025-04-13 22:15:22,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:22,693 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 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 42 [2025-04-13 22:15:22,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:22,696 INFO L225 Difference]: With dead ends: 682 [2025-04-13 22:15:22,696 INFO L226 Difference]: Without dead ends: 631 [2025-04-13 22:15:22,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=384, Invalid=2268, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:15:22,697 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:22,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:15:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-04-13 22:15:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 575. [2025-04-13 22:15:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 3.3257839721254356) internal successors, (1909), 574 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1909 transitions. [2025-04-13 22:15:22,853 INFO L79 Accepts]: Start accepts. Automaton has 575 states and 1909 transitions. Word has length 42 [2025-04-13 22:15:22,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:22,854 INFO L485 AbstractCegarLoop]: Abstraction has 575 states and 1909 transitions. [2025-04-13 22:15:22,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:22,854 INFO L278 IsEmpty]: Start isEmpty. Operand 575 states and 1909 transitions. [2025-04-13 22:15:22,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:15:22,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:22,855 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:22,862 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 22:15:23,055 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,SelfDestructingSolverStorable27 [2025-04-13 22:15:23,055 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:15:23,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1036169459, now seen corresponding path program 9 times [2025-04-13 22:15:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:23,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656285963] [2025-04-13 22:15:23,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:23,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:15:23,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:15:23,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:24,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656285963] [2025-04-13 22:15:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656285963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:24,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641834460] [2025-04-13 22:15:24,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:24,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:24,083 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 22:15:24,084 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 22:15:24,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:15:24,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:15:24,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:24,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:24,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:15:24,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:24,538 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:15:24,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:15:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:24,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:25,510 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:15:25,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:15:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641834460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:25,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2025-04-13 22:15:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821050008] [2025-04-13 22:15:25,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:25,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:15:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:25,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:15:25,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:25,674 INFO L87 Difference]: Start difference. First operand 575 states and 1909 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:27,582 INFO L93 Difference]: Finished difference Result 714 states and 2354 transitions. [2025-04-13 22:15:27,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:27,582 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 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 42 [2025-04-13 22:15:27,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:27,586 INFO L225 Difference]: With dead ends: 714 [2025-04-13 22:15:27,586 INFO L226 Difference]: Without dead ends: 665 [2025-04-13 22:15:27,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:15:27,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:27,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:15:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-04-13 22:15:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 597. [2025-04-13 22:15:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.36744966442953) internal successors, (2007), 596 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2007 transitions. [2025-04-13 22:15:27,759 INFO L79 Accepts]: Start accepts. Automaton has 597 states and 2007 transitions. Word has length 42 [2025-04-13 22:15:27,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:27,759 INFO L485 AbstractCegarLoop]: Abstraction has 597 states and 2007 transitions. [2025-04-13 22:15:27,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:27,759 INFO L278 IsEmpty]: Start isEmpty. Operand 597 states and 2007 transitions. [2025-04-13 22:15:27,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:15:27,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:27,760 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:27,767 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 22:15:27,960 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,SelfDestructingSolverStorable28 [2025-04-13 22:15:27,960 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:15:27,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1054603485, now seen corresponding path program 10 times [2025-04-13 22:15:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:27,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112759233] [2025-04-13 22:15:27,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:27,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:15:28,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:28,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:29,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112759233] [2025-04-13 22:15:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112759233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:29,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705285975] [2025-04-13 22:15:29,316 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:29,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:29,318 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 22:15:29,319 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 22:15:29,446 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:15:29,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:29,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:29,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:15:29,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:29,665 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 22:15:29,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:15:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:29,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:38,714 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:15:38,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:15:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:15:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705285975] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:39,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2025-04-13 22:15:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880216067] [2025-04-13 22:15:39,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:39,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:15:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:39,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:15:39,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=875, Unknown=2, NotChecked=0, Total=992 [2025-04-13 22:15:39,779 INFO L87 Difference]: Start difference. First operand 597 states and 2007 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:43,570 INFO L93 Difference]: Finished difference Result 1159 states and 3787 transitions. [2025-04-13 22:15:43,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:15:43,571 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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 42 [2025-04-13 22:15:43,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:43,575 INFO L225 Difference]: With dead ends: 1159 [2025-04-13 22:15:43,575 INFO L226 Difference]: Without dead ends: 1047 [2025-04-13 22:15:43,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=553, Invalid=3105, Unknown=2, NotChecked=0, Total=3660 [2025-04-13 22:15:43,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:43,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:15:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-04-13 22:15:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 685. [2025-04-13 22:15:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 3.491228070175439) internal successors, (2388), 684 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2388 transitions. [2025-04-13 22:15:43,802 INFO L79 Accepts]: Start accepts. Automaton has 685 states and 2388 transitions. Word has length 42 [2025-04-13 22:15:43,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:43,802 INFO L485 AbstractCegarLoop]: Abstraction has 685 states and 2388 transitions. [2025-04-13 22:15:43,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:43,802 INFO L278 IsEmpty]: Start isEmpty. Operand 685 states and 2388 transitions. [2025-04-13 22:15:43,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:15:43,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:43,803 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:43,811 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 22:15:44,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:44,004 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:15:44,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -631347517, now seen corresponding path program 11 times [2025-04-13 22:15:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:44,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074188825] [2025-04-13 22:15:44,004 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:44,014 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:15:44,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:44,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:44,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:15:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:45,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074188825] [2025-04-13 22:15:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074188825] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:45,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086624095] [2025-04-13 22:15:45,216 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:45,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:45,218 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 22:15:45,219 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 22:15:45,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:15:45,796 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:15:45,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:45,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:45,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:15:45,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:46,214 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 22:15:46,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:15:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:15:46,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:47,322 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:15:47,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:15:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:15:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086624095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:47,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 42 [2025-04-13 22:15:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857129982] [2025-04-13 22:15:47,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:47,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 22:15:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 22:15:47,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:15:47,564 INFO L87 Difference]: Start difference. First operand 685 states and 2388 transitions. Second operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:07,346 INFO L93 Difference]: Finished difference Result 4536 states and 15836 transitions. [2025-04-13 22:16:07,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-04-13 22:16:07,347 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 0 states have call successors, (0), 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 42 [2025-04-13 22:16:07,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:07,371 INFO L225 Difference]: With dead ends: 4536 [2025-04-13 22:16:07,372 INFO L226 Difference]: Without dead ends: 4133 [2025-04-13 22:16:07,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7951 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3561, Invalid=21245, Unknown=0, NotChecked=0, Total=24806 [2025-04-13 22:16:07,380 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 773 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5691 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 5691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:07,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 0 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 5691 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-04-13 22:16:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2025-04-13 22:16:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 1012. [2025-04-13 22:16:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.644906033630069) internal successors, (3685), 1011 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3685 transitions. [2025-04-13 22:16:07,902 INFO L79 Accepts]: Start accepts. Automaton has 1012 states and 3685 transitions. Word has length 42 [2025-04-13 22:16:07,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:07,902 INFO L485 AbstractCegarLoop]: Abstraction has 1012 states and 3685 transitions. [2025-04-13 22:16:07,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:07,903 INFO L278 IsEmpty]: Start isEmpty. Operand 1012 states and 3685 transitions. [2025-04-13 22:16:07,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:16:07,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:07,904 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:07,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:16:08,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:08,105 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:16:08,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1664651897, now seen corresponding path program 12 times [2025-04-13 22:16:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:08,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788760469] [2025-04-13 22:16:08,105 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:08,115 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:16:08,139 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:16:08,140 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:08,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:16:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:09,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788760469] [2025-04-13 22:16:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788760469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:09,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330731112] [2025-04-13 22:16:09,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:09,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:09,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:09,264 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 22:16:09,266 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 22:16:09,408 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:16:09,449 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:16:09,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:09,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:16:09,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:09,819 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:09,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 22:16:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:16:09,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:10,795 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:16:10,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:16:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:16:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330731112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:10,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 31 [2025-04-13 22:16:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161090018] [2025-04-13 22:16:10,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:10,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:16:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:10,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:16:10,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:16:10,982 INFO L87 Difference]: Start difference. First operand 1012 states and 3685 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:13,793 INFO L93 Difference]: Finished difference Result 1324 states and 4781 transitions. [2025-04-13 22:16:13,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:16:13,793 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 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 42 [2025-04-13 22:16:13,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:13,798 INFO L225 Difference]: With dead ends: 1324 [2025-04-13 22:16:13,798 INFO L226 Difference]: Without dead ends: 1310 [2025-04-13 22:16:13,799 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=2018, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:16:13,799 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:13,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:16:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-04-13 22:16:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1023. [2025-04-13 22:16:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.642857142857143) internal successors, (3723), 1022 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 3723 transitions. [2025-04-13 22:16:14,333 INFO L79 Accepts]: Start accepts. Automaton has 1023 states and 3723 transitions. Word has length 42 [2025-04-13 22:16:14,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:14,333 INFO L485 AbstractCegarLoop]: Abstraction has 1023 states and 3723 transitions. [2025-04-13 22:16:14,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:14,333 INFO L278 IsEmpty]: Start isEmpty. Operand 1023 states and 3723 transitions. [2025-04-13 22:16:14,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:16:14,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:14,335 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:14,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:14,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:14,536 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:16:14,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1768324577, now seen corresponding path program 13 times [2025-04-13 22:16:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:14,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261490926] [2025-04-13 22:16:14,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:14,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:16:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:16:14,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:14,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:16:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:16,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261490926] [2025-04-13 22:16:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261490926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:16,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142073689] [2025-04-13 22:16:16,805 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:16,806 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 22:16:16,807 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 22:16:16,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:16:16,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:16:16,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:16,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:16,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:16:16,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:17,221 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 22:16:17,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:16:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:16:17,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:50,668 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:16:50,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:16:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:16:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142073689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:51,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 42 [2025-04-13 22:16:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836768046] [2025-04-13 22:16:51,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:51,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 22:16:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:51,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 22:16:51,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1662, Unknown=8, NotChecked=0, Total=1806 [2025-04-13 22:16:51,425 INFO L87 Difference]: Start difference. First operand 1023 states and 3723 transitions. Second operand has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,775 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:12,329 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:25,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:29,213 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:33,358 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:37,656 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:41,683 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:45,703 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:52,644 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:17:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:54,914 INFO L93 Difference]: Finished difference Result 1621 states and 5626 transitions. [2025-04-13 22:17:54,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 22:17:54,914 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 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 42 [2025-04-13 22:17:54,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:54,920 INFO L225 Difference]: With dead ends: 1621 [2025-04-13 22:17:54,920 INFO L226 Difference]: Without dead ends: 1503 [2025-04-13 22:17:54,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=871, Invalid=7490, Unknown=11, NotChecked=0, Total=8372 [2025-04-13 22:17:54,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 552 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 129 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:54,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 0 Invalid, 3527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3389 Invalid, 9 Unknown, 0 Unchecked, 39.7s Time] [2025-04-13 22:17:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-04-13 22:17:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1108. [2025-04-13 22:17:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 3.669376693766938) internal successors, (4062), 1107 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 4062 transitions. [2025-04-13 22:17:55,722 INFO L79 Accepts]: Start accepts. Automaton has 1108 states and 4062 transitions. Word has length 42 [2025-04-13 22:17:55,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:55,722 INFO L485 AbstractCegarLoop]: Abstraction has 1108 states and 4062 transitions. [2025-04-13 22:17:55,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:55,723 INFO L278 IsEmpty]: Start isEmpty. Operand 1108 states and 4062 transitions. [2025-04-13 22:17:55,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:17:55,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:55,724 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:55,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:55,924 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,SelfDestructingSolverStorable32 [2025-04-13 22:17:55,925 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:55,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 49980871, now seen corresponding path program 14 times [2025-04-13 22:17:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:55,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438271325] [2025-04-13 22:17:55,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:55,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:17:55,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:17:55,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:17:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:56,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438271325] [2025-04-13 22:17:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438271325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:56,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22709529] [2025-04-13 22:17:56,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:56,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:56,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:56,845 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 22:17:56,846 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 22:17:56,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:17:57,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:17:57,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:57,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:57,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:17:57,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:57,415 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:17:57,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:17:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:17:57,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:58,566 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:17:58,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:17:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:17:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22709529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:58,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2025-04-13 22:17:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348756665] [2025-04-13 22:17:58,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:58,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:17:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:58,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:17:58,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:17:58,865 INFO L87 Difference]: Start difference. First operand 1108 states and 4062 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:02,711 INFO L93 Difference]: Finished difference Result 1421 states and 5126 transitions. [2025-04-13 22:18:02,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:18:02,711 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 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 42 [2025-04-13 22:18:02,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:02,716 INFO L225 Difference]: With dead ends: 1421 [2025-04-13 22:18:02,716 INFO L226 Difference]: Without dead ends: 1370 [2025-04-13 22:18:02,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=448, Invalid=2858, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:18:02,716 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:02,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:18:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-04-13 22:18:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1108. [2025-04-13 22:18:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 3.669376693766938) internal successors, (4062), 1107 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 4062 transitions. [2025-04-13 22:18:03,542 INFO L79 Accepts]: Start accepts. Automaton has 1108 states and 4062 transitions. Word has length 42 [2025-04-13 22:18:03,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:03,543 INFO L485 AbstractCegarLoop]: Abstraction has 1108 states and 4062 transitions. [2025-04-13 22:18:03,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:03,543 INFO L278 IsEmpty]: Start isEmpty. Operand 1108 states and 4062 transitions. [2025-04-13 22:18:03,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:18:03,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:03,544 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:03,551 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 22:18:03,745 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,SelfDestructingSolverStorable33 [2025-04-13 22:18:03,745 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:18:03,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash 243818275, now seen corresponding path program 15 times [2025-04-13 22:18:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:03,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917394056] [2025-04-13 22:18:03,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:03,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:18:03,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:18:03,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:03,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:18:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:04,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917394056] [2025-04-13 22:18:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917394056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:04,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772087347] [2025-04-13 22:18:04,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:04,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:04,812 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 22:18:04,812 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 22:18:04,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:18:05,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:18:05,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:05,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:18:05,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:05,550 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:18:05,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 22:18:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:18:05,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:06,927 INFO L325 Elim1Store]: treesize reduction 28, result has 93.2 percent of original size [2025-04-13 22:18:06,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 204 treesize of output 440 [2025-04-13 22:18:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:18:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772087347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:07,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 32 [2025-04-13 22:18:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596158074] [2025-04-13 22:18:07,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:07,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:18:07,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:07,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:18:07,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:18:07,509 INFO L87 Difference]: Start difference. First operand 1108 states and 4062 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:13,985 INFO L93 Difference]: Finished difference Result 2063 states and 7059 transitions. [2025-04-13 22:18:13,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:18:13,986 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 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 42 [2025-04-13 22:18:13,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:13,992 INFO L225 Difference]: With dead ends: 2063 [2025-04-13 22:18:13,992 INFO L226 Difference]: Without dead ends: 2023 [2025-04-13 22:18:13,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=652, Invalid=3380, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:18:13,993 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:13,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:18:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-04-13 22:18:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1128. [2025-04-13 22:18:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 3.6725820763087844) internal successors, (4139), 1127 states have internal predecessors, (4139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 4139 transitions. [2025-04-13 22:18:14,867 INFO L79 Accepts]: Start accepts. Automaton has 1128 states and 4139 transitions. Word has length 42 [2025-04-13 22:18:14,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:14,868 INFO L485 AbstractCegarLoop]: Abstraction has 1128 states and 4139 transitions. [2025-04-13 22:18:14,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:14,868 INFO L278 IsEmpty]: Start isEmpty. Operand 1128 states and 4139 transitions. [2025-04-13 22:18:14,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:18:14,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:14,869 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:14,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 22:18:15,070 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,SelfDestructingSolverStorable34 [2025-04-13 22:18:15,070 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:18:15,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -336141961, now seen corresponding path program 16 times [2025-04-13 22:18:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:15,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69692526] [2025-04-13 22:18:15,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:15,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:18:15,109 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:18:15,109 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:18:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:16,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69692526] [2025-04-13 22:18:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69692526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:16,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745457336] [2025-04-13 22:18:16,102 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:16,104 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 22:18:16,104 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 22:18:16,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:18:16,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:18:16,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:16,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:18:16,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:16,621 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 22:18:16,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 22:18:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:18:16,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:25,660 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:18:25,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:18:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:18:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745457336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:26,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2025-04-13 22:18:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962149942] [2025-04-13 22:18:26,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:26,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:18:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:26,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:18:26,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=942, Unknown=2, NotChecked=0, Total=1056 [2025-04-13 22:18:26,835 INFO L87 Difference]: Start difference. First operand 1128 states and 4139 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:32,974 INFO L93 Difference]: Finished difference Result 1766 states and 6188 transitions. [2025-04-13 22:18:32,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:18:32,974 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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 42 [2025-04-13 22:18:32,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:32,980 INFO L225 Difference]: With dead ends: 1766 [2025-04-13 22:18:32,980 INFO L226 Difference]: Without dead ends: 1679 [2025-04-13 22:18:32,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=542, Invalid=3488, Unknown=2, NotChecked=0, Total=4032 [2025-04-13 22:18:32,981 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 368 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:32,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 0 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:18:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-04-13 22:18:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1194. [2025-04-13 22:18:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 3.6672254819782064) internal successors, (4375), 1193 states have internal predecessors, (4375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 4375 transitions. [2025-04-13 22:18:33,926 INFO L79 Accepts]: Start accepts. Automaton has 1194 states and 4375 transitions. Word has length 42 [2025-04-13 22:18:33,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:33,926 INFO L485 AbstractCegarLoop]: Abstraction has 1194 states and 4375 transitions. [2025-04-13 22:18:33,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:33,926 INFO L278 IsEmpty]: Start isEmpty. Operand 1194 states and 4375 transitions. [2025-04-13 22:18:33,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:18:33,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:33,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:33,935 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 22:18:34,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:34,129 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:18:34,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2097316409, now seen corresponding path program 17 times [2025-04-13 22:18:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:34,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201186047] [2025-04-13 22:18:34,129 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:34,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:18:34,176 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:18:34,176 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:18:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:35,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201186047] [2025-04-13 22:18:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201186047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:35,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769912014] [2025-04-13 22:18:35,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:35,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:35,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:35,792 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 22:18:35,793 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 22:18:35,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:18:36,562 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:18:36,562 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:36,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:36,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:18:36,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:36,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:36,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 92 [2025-04-13 22:18:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:18:37,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:38,105 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:18:38,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:18:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:18:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769912014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:38,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 10] total 38 [2025-04-13 22:18:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151036690] [2025-04-13 22:18:38,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:38,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:18:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:38,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:18:38,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:18:38,361 INFO L87 Difference]: Start difference. First operand 1194 states and 4375 transitions. Second operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:57,970 INFO L93 Difference]: Finished difference Result 2945 states and 10220 transitions. [2025-04-13 22:18:57,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 22:18:57,970 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 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 42 [2025-04-13 22:18:57,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:57,977 INFO L225 Difference]: With dead ends: 2945 [2025-04-13 22:18:57,977 INFO L226 Difference]: Without dead ends: 2788 [2025-04-13 22:18:57,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1531, Invalid=7975, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 22:18:57,979 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 614 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:57,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 0 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 22:18:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2025-04-13 22:18:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1630. [2025-04-13 22:18:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 3.7354205033763046) internal successors, (6085), 1629 states have internal predecessors, (6085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 6085 transitions. [2025-04-13 22:18:59,949 INFO L79 Accepts]: Start accepts. Automaton has 1630 states and 6085 transitions. Word has length 42 [2025-04-13 22:18:59,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:59,949 INFO L485 AbstractCegarLoop]: Abstraction has 1630 states and 6085 transitions. [2025-04-13 22:18:59,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:59,950 INFO L278 IsEmpty]: Start isEmpty. Operand 1630 states and 6085 transitions. [2025-04-13 22:18:59,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:18:59,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:59,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:59,961 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 22:19:00,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 22:19:00,153 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:00,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2055856155, now seen corresponding path program 18 times [2025-04-13 22:19:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:00,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916959966] [2025-04-13 22:19:00,153 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:00,163 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:19:00,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:19:00,182 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:19:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:00,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916959966] [2025-04-13 22:19:00,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916959966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:00,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981844710] [2025-04-13 22:19:00,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:00,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:00,937 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 22:19:00,938 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 22:19:01,086 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:19:01,123 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:19:01,123 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:01,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:01,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:19:01,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:01,521 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:01,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 22:19:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:01,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:02,488 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:19:02,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:19:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981844710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:03,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:03,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 32 [2025-04-13 22:19:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933159418] [2025-04-13 22:19:03,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:03,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:19:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:03,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:19:03,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:19:03,358 INFO L87 Difference]: Start difference. First operand 1630 states and 6085 transitions. Second operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:09,540 INFO L93 Difference]: Finished difference Result 2132 states and 7754 transitions. [2025-04-13 22:19:09,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:19:09,540 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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 42 [2025-04-13 22:19:09,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:09,550 INFO L225 Difference]: With dead ends: 2132 [2025-04-13 22:19:09,550 INFO L226 Difference]: Without dead ends: 2102 [2025-04-13 22:19:09,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=315, Invalid=2135, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:19:09,551 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:09,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:19:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2025-04-13 22:19:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1622. [2025-04-13 22:19:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 3.730413325107958) internal successors, (6047), 1621 states have internal predecessors, (6047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 6047 transitions. [2025-04-13 22:19:11,506 INFO L79 Accepts]: Start accepts. Automaton has 1622 states and 6047 transitions. Word has length 42 [2025-04-13 22:19:11,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:11,507 INFO L485 AbstractCegarLoop]: Abstraction has 1622 states and 6047 transitions. [2025-04-13 22:19:11,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:11,507 INFO L278 IsEmpty]: Start isEmpty. Operand 1622 states and 6047 transitions. [2025-04-13 22:19:11,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:19:11,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:11,509 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:11,517 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 22:19:11,709 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,SelfDestructingSolverStorable37 [2025-04-13 22:19:11,710 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:11,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -675626461, now seen corresponding path program 19 times [2025-04-13 22:19:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:11,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744080947] [2025-04-13 22:19:11,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:11,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:19:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:19:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:12,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744080947] [2025-04-13 22:19:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744080947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:12,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155384143] [2025-04-13 22:19:12,765 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:12,767 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 22:19:12,768 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 22:19:12,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:19:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:12,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:12,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:19:12,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:13,206 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:13,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 104 [2025-04-13 22:19:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:13,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:18,781 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:19:18,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:19:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:20,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155384143] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:20,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:20,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2025-04-13 22:19:20,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019339581] [2025-04-13 22:19:20,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:20,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:19:20,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:20,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:19:20,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=946, Unknown=1, NotChecked=0, Total=1056 [2025-04-13 22:19:20,186 INFO L87 Difference]: Start difference. First operand 1622 states and 6047 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:32,478 INFO L93 Difference]: Finished difference Result 2929 states and 10016 transitions. [2025-04-13 22:19:32,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 22:19:32,479 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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 42 [2025-04-13 22:19:32,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:32,487 INFO L225 Difference]: With dead ends: 2929 [2025-04-13 22:19:32,487 INFO L226 Difference]: Without dead ends: 2714 [2025-04-13 22:19:32,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=848, Invalid=5471, Unknown=1, NotChecked=0, Total=6320 [2025-04-13 22:19:32,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 435 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:32,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 0 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:19:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2025-04-13 22:19:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 1683. [2025-04-13 22:19:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 3.771700356718193) internal successors, (6344), 1682 states have internal predecessors, (6344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 6344 transitions. [2025-04-13 22:19:34,600 INFO L79 Accepts]: Start accepts. Automaton has 1683 states and 6344 transitions. Word has length 42 [2025-04-13 22:19:34,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:34,600 INFO L485 AbstractCegarLoop]: Abstraction has 1683 states and 6344 transitions. [2025-04-13 22:19:34,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:34,600 INFO L278 IsEmpty]: Start isEmpty. Operand 1683 states and 6344 transitions. [2025-04-13 22:19:34,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:19:34,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:34,603 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:34,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:34,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 22:19:34,804 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:34,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 291448729, now seen corresponding path program 20 times [2025-04-13 22:19:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:34,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326963555] [2025-04-13 22:19:34,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:34,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:19:34,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:34,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:34,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:35,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:35,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326963555] [2025-04-13 22:19:35,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326963555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:35,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723436339] [2025-04-13 22:19:35,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:35,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:35,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:35,766 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 22:19:35,767 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 22:19:35,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:19:35,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:35,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:35,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:19:35,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:36,317 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:19:36,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:19:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:36,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:37,303 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:19:37,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:19:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723436339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:37,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 31 [2025-04-13 22:19:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751145667] [2025-04-13 22:19:37,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:37,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:19:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:37,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:19:37,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:19:37,513 INFO L87 Difference]: Start difference. First operand 1683 states and 6344 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:42,826 INFO L93 Difference]: Finished difference Result 1928 states and 7151 transitions. [2025-04-13 22:19:42,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:19:42,826 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 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 42 [2025-04-13 22:19:42,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:42,832 INFO L225 Difference]: With dead ends: 1928 [2025-04-13 22:19:42,832 INFO L226 Difference]: Without dead ends: 1845 [2025-04-13 22:19:42,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:19:42,832 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:42,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:19:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-04-13 22:19:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1725. [2025-04-13 22:19:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 3.7639211136890953) internal successors, (6489), 1724 states have internal predecessors, (6489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 6489 transitions. [2025-04-13 22:19:45,020 INFO L79 Accepts]: Start accepts. Automaton has 1725 states and 6489 transitions. Word has length 42 [2025-04-13 22:19:45,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:45,020 INFO L485 AbstractCegarLoop]: Abstraction has 1725 states and 6489 transitions. [2025-04-13 22:19:45,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:45,020 INFO L278 IsEmpty]: Start isEmpty. Operand 1725 states and 6489 transitions. [2025-04-13 22:19:45,023 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:19:45,023 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:45,023 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:45,030 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 22:19:45,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 22:19:45,223 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:45,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 395121409, now seen corresponding path program 21 times [2025-04-13 22:19:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:45,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554711119] [2025-04-13 22:19:45,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:45,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:19:45,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 22:19:45,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:19:45,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:45,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554711119] [2025-04-13 22:19:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554711119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:45,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410298292] [2025-04-13 22:19:45,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:45,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:45,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:45,922 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 22:19:45,924 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 22:19:46,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:19:46,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 22:19:46,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:19:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:46,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:19:46,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:46,452 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:19:46,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:19:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:46,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:47,499 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:19:47,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:19:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410298292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:47,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 22:19:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271734746] [2025-04-13 22:19:47,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:47,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:19:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:47,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:19:47,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:19:47,782 INFO L87 Difference]: Start difference. First operand 1725 states and 6489 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:52,879 INFO L93 Difference]: Finished difference Result 1905 states and 7075 transitions. [2025-04-13 22:19:52,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:19:52,880 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2025-04-13 22:19:52,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:52,885 INFO L225 Difference]: With dead ends: 1905 [2025-04-13 22:19:52,885 INFO L226 Difference]: Without dead ends: 1847 [2025-04-13 22:19:52,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:19:52,885 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:52,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:19:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-04-13 22:19:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1743. [2025-04-13 22:19:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1742 states have (on average 3.7606199770378876) internal successors, (6551), 1742 states have internal predecessors, (6551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 6551 transitions. [2025-04-13 22:19:55,108 INFO L79 Accepts]: Start accepts. Automaton has 1743 states and 6551 transitions. Word has length 42 [2025-04-13 22:19:55,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:55,108 INFO L485 AbstractCegarLoop]: Abstraction has 1743 states and 6551 transitions. [2025-04-13 22:19:55,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:55,108 INFO L278 IsEmpty]: Start isEmpty. Operand 1743 states and 6551 transitions. [2025-04-13 22:19:55,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:19:55,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:55,110 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:55,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:55,311 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,SelfDestructingSolverStorable40 [2025-04-13 22:19:55,311 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:55,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:55,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1323222297, now seen corresponding path program 22 times [2025-04-13 22:19:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:55,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994969179] [2025-04-13 22:19:55,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:55,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:19:55,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:55,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:55,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:19:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:56,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994969179] [2025-04-13 22:19:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994969179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:56,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792337419] [2025-04-13 22:19:56,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:56,403 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 22:19:56,403 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 22:19:56,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:19:56,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:19:56,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:56,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:56,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:19:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:56,846 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 22:19:56,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:19:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:19:56,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:26,122 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:20:26,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:20:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:20:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792337419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:26,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2025-04-13 22:20:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264761532] [2025-04-13 22:20:26,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:26,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:20:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:26,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:20:26,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=931, Unknown=7, NotChecked=0, Total=1056 [2025-04-13 22:20:26,930 INFO L87 Difference]: Start difference. First operand 1743 states and 6551 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:37,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:20:47,447 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:20:51,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:20:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:56,670 INFO L93 Difference]: Finished difference Result 2312 states and 8469 transitions. [2025-04-13 22:20:56,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:20:56,670 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 42 [2025-04-13 22:20:56,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:56,676 INFO L225 Difference]: With dead ends: 2312 [2025-04-13 22:20:56,676 INFO L226 Difference]: Without dead ends: 2152 [2025-04-13 22:20:56,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=483, Invalid=3414, Unknown=9, NotChecked=0, Total=3906 [2025-04-13 22:20:56,677 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 56 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:56,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1790 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2025-04-13 22:20:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2025-04-13 22:20:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 1821. [2025-04-13 22:20:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 3.7994505494505493) internal successors, (6915), 1820 states have internal predecessors, (6915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 6915 transitions. [2025-04-13 22:20:59,246 INFO L79 Accepts]: Start accepts. Automaton has 1821 states and 6915 transitions. Word has length 42 [2025-04-13 22:20:59,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:59,247 INFO L485 AbstractCegarLoop]: Abstraction has 1821 states and 6915 transitions. [2025-04-13 22:20:59,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:59,247 INFO L278 IsEmpty]: Start isEmpty. Operand 1821 states and 6915 transitions. [2025-04-13 22:20:59,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:20:59,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:59,250 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:59,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:59,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:59,450 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:20:59,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1843700537, now seen corresponding path program 23 times [2025-04-13 22:20:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:59,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013554060] [2025-04-13 22:20:59,450 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:59,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:20:59,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:20:59,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:21:00,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:00,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013554060] [2025-04-13 22:21:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013554060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:00,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164196101] [2025-04-13 22:21:00,817 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:00,819 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 22:21:00,831 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 22:21:00,999 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:21:01,542 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:21:01,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:01,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:21:01,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:02,028 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 22:21:02,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:21:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:21:02,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:03,153 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:21:03,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:21:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:21:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164196101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:03,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 10] total 38 [2025-04-13 22:21:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908205217] [2025-04-13 22:21:03,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:03,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:21:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:03,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:21:03,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:21:03,332 INFO L87 Difference]: Start difference. First operand 1821 states and 6915 transitions. Second operand has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:24,001 INFO L93 Difference]: Finished difference Result 3623 states and 13497 transitions. [2025-04-13 22:21:24,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:21:24,001 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 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 42 [2025-04-13 22:21:24,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:24,009 INFO L225 Difference]: With dead ends: 3623 [2025-04-13 22:21:24,009 INFO L226 Difference]: Without dead ends: 3585 [2025-04-13 22:21:24,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1119, Invalid=7437, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 22:21:24,011 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 547 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3862 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:24,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 0 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3862 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 22:21:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2025-04-13 22:21:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 2061. [2025-04-13 22:21:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2060 states have (on average 3.8344660194174756) internal successors, (7899), 2060 states have internal predecessors, (7899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 7899 transitions. [2025-04-13 22:21:27,284 INFO L79 Accepts]: Start accepts. Automaton has 2061 states and 7899 transitions. Word has length 42 [2025-04-13 22:21:27,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:27,285 INFO L485 AbstractCegarLoop]: Abstraction has 2061 states and 7899 transitions. [2025-04-13 22:21:27,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:27,285 INFO L278 IsEmpty]: Start isEmpty. Operand 2061 states and 7899 transitions. [2025-04-13 22:21:27,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:21:27,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:27,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:27,296 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 22:21:27,488 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,SelfDestructingSolverStorable42 [2025-04-13 22:21:27,488 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:21:27,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1947373217, now seen corresponding path program 24 times [2025-04-13 22:21:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:27,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789174810] [2025-04-13 22:21:27,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:27,499 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:21:27,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:21:27,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:27,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:21:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:28,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789174810] [2025-04-13 22:21:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789174810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:28,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192615266] [2025-04-13 22:21:28,587 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:28,588 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 22:21:28,589 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 22:21:28,759 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:21:28,845 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:21:28,845 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:28,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:21:28,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:29,280 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:21:29,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:21:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:21:29,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:30,452 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:21:30,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:21:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:21:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192615266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:30,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 34 [2025-04-13 22:21:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926702565] [2025-04-13 22:21:30,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:30,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:21:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:30,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:21:30,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:21:30,704 INFO L87 Difference]: Start difference. First operand 2061 states and 7899 transitions. Second operand has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:39,295 INFO L93 Difference]: Finished difference Result 2277 states and 8580 transitions. [2025-04-13 22:21:39,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:21:39,296 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 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 42 [2025-04-13 22:21:39,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:39,302 INFO L225 Difference]: With dead ends: 2277 [2025-04-13 22:21:39,302 INFO L226 Difference]: Without dead ends: 2263 [2025-04-13 22:21:39,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=475, Invalid=3065, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:21:39,302 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:39,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:21:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-04-13 22:21:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2065. [2025-04-13 22:21:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 2064 states have (on average 3.83672480620155) internal successors, (7919), 2064 states have internal predecessors, (7919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 7919 transitions. [2025-04-13 22:21:42,656 INFO L79 Accepts]: Start accepts. Automaton has 2065 states and 7919 transitions. Word has length 42 [2025-04-13 22:21:42,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:42,656 INFO L485 AbstractCegarLoop]: Abstraction has 2065 states and 7919 transitions. [2025-04-13 22:21:42,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:42,656 INFO L278 IsEmpty]: Start isEmpty. Operand 2065 states and 7919 transitions. [2025-04-13 22:21:42,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:21:42,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:42,659 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:42,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:42,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:42,860 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:21:42,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1140523817, now seen corresponding path program 25 times [2025-04-13 22:21:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:42,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316334239] [2025-04-13 22:21:42,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:42,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:21:42,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:21:42,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:42,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:21:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:43,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316334239] [2025-04-13 22:21:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316334239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:43,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580443088] [2025-04-13 22:21:43,848 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:43,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:43,850 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:43,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 22:21:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:21:44,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:21:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:44,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:21:44,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:44,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:44,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 104 [2025-04-13 22:21:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:21:44,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:13,894 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:22:13,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:22:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:22:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580443088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:15,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:15,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2025-04-13 22:22:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245333317] [2025-04-13 22:22:15,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:15,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:22:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:15,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:22:15,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=938, Unknown=7, NotChecked=0, Total=1056 [2025-04-13 22:22:15,109 INFO L87 Difference]: Start difference. First operand 2065 states and 7919 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:25,256 INFO L93 Difference]: Finished difference Result 2602 states and 9491 transitions. [2025-04-13 22:22:25,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:22:25,256 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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 42 [2025-04-13 22:22:25,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:25,263 INFO L225 Difference]: With dead ends: 2602 [2025-04-13 22:22:25,263 INFO L226 Difference]: Without dead ends: 2510 [2025-04-13 22:22:25,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=659, Invalid=4304, Unknown=7, NotChecked=0, Total=4970 [2025-04-13 22:22:25,264 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:25,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 22:22:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2025-04-13 22:22:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2101. [2025-04-13 22:22:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 2100 states have (on average 3.830952380952381) internal successors, (8045), 2100 states have internal predecessors, (8045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8045 transitions. [2025-04-13 22:22:28,689 INFO L79 Accepts]: Start accepts. Automaton has 2101 states and 8045 transitions. Word has length 42 [2025-04-13 22:22:28,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:28,689 INFO L485 AbstractCegarLoop]: Abstraction has 2101 states and 8045 transitions. [2025-04-13 22:22:28,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:28,689 INFO L278 IsEmpty]: Start isEmpty. Operand 2101 states and 8045 transitions. [2025-04-13 22:22:28,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:22:28,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:28,692 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:28,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 22:22:28,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 22:22:28,893 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:22:28,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -887782079, now seen corresponding path program 26 times [2025-04-13 22:22:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:28,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477357014] [2025-04-13 22:22:28,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:28,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:22:28,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:22:28,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:28,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:22:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:29,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477357014] [2025-04-13 22:22:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477357014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:29,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325852560] [2025-04-13 22:22:29,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:29,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:29,793 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:29,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 22:22:29,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:22:30,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:22:30,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:30,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:22:30,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:30,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:30,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 80 [2025-04-13 22:22:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:22:30,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:31,647 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:22:31,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:22:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:22:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325852560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:32,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 33 [2025-04-13 22:22:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870857578] [2025-04-13 22:22:32,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:32,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:22:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:32,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:22:32,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:22:32,803 INFO L87 Difference]: Start difference. First operand 2101 states and 8045 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:40,824 INFO L93 Difference]: Finished difference Result 2327 states and 8770 transitions. [2025-04-13 22:22:40,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:22:40,825 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 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 42 [2025-04-13 22:22:40,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:40,831 INFO L225 Difference]: With dead ends: 2327 [2025-04-13 22:22:40,831 INFO L226 Difference]: Without dead ends: 2298 [2025-04-13 22:22:40,831 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=502, Invalid=3038, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:22:40,831 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:40,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:22:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2025-04-13 22:22:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2103. [2025-04-13 22:22:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2102 states have (on average 3.8325404376784014) internal successors, (8056), 2102 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 8056 transitions. [2025-04-13 22:22:44,264 INFO L79 Accepts]: Start accepts. Automaton has 2103 states and 8056 transitions. Word has length 42 [2025-04-13 22:22:44,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:44,264 INFO L485 AbstractCegarLoop]: Abstraction has 2103 states and 8056 transitions. [2025-04-13 22:22:44,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:44,264 INFO L278 IsEmpty]: Start isEmpty. Operand 2103 states and 8056 transitions. [2025-04-13 22:22:44,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:22:44,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:44,267 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:44,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 22:22:44,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 22:22:44,468 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:22:44,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 981276743, now seen corresponding path program 27 times [2025-04-13 22:22:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:44,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048976490] [2025-04-13 22:22:44,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:44,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:22:44,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:22:44,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:44,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:22:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:45,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048976490] [2025-04-13 22:22:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048976490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:45,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168359721] [2025-04-13 22:22:45,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:45,300 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:45,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 22:22:45,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:22:45,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 22:22:45,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:45,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:22:45,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:46,059 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:22:46,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:22:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:22:46,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:47,691 INFO L325 Elim1Store]: treesize reduction 28, result has 93.2 percent of original size [2025-04-13 22:22:47,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 204 treesize of output 440 [2025-04-13 22:22:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:22:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168359721] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:48,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 34 [2025-04-13 22:22:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688518164] [2025-04-13 22:22:48,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:48,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:22:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:48,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:22:48,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:22:48,566 INFO L87 Difference]: Start difference. First operand 2103 states and 8056 transitions. Second operand has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:56,542 INFO L93 Difference]: Finished difference Result 2349 states and 8855 transitions. [2025-04-13 22:22:56,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:22:56,542 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 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 42 [2025-04-13 22:22:56,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:56,548 INFO L225 Difference]: With dead ends: 2349 [2025-04-13 22:22:56,548 INFO L226 Difference]: Without dead ends: 2298 [2025-04-13 22:22:56,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=479, Invalid=3061, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:22:56,549 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:56,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:22:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2025-04-13 22:22:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2107. [2025-04-13 22:22:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2106 states have (on average 3.831908831908832) internal successors, (8070), 2106 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 8070 transitions. [2025-04-13 22:22:59,998 INFO L79 Accepts]: Start accepts. Automaton has 2107 states and 8070 transitions. Word has length 42 [2025-04-13 22:22:59,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:59,998 INFO L485 AbstractCegarLoop]: Abstraction has 2107 states and 8070 transitions. [2025-04-13 22:22:59,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:59,998 INFO L278 IsEmpty]: Start isEmpty. Operand 2107 states and 8070 transitions. [2025-04-13 22:23:00,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:23:00,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:00,002 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:00,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 22:23:00,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 22:23:00,202 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:23:00,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2139728039, now seen corresponding path program 28 times [2025-04-13 22:23:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:00,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016504964] [2025-04-13 22:23:00,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:00,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:23:00,241 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:23:00,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:23:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:01,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016504964] [2025-04-13 22:23:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016504964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:01,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70916003] [2025-04-13 22:23:01,665 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:01,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:01,667 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:01,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 22:23:01,867 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:23:01,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:23:01,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:01,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:01,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:23:01,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:02,119 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:02,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 104 [2025-04-13 22:23:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:02,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:23,787 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:23:23,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:23:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70916003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:24,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 31 [2025-04-13 22:23:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370919225] [2025-04-13 22:23:24,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:24,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:23:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:23:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=881, Unknown=5, NotChecked=0, Total=992 [2025-04-13 22:23:24,525 INFO L87 Difference]: Start difference. First operand 2107 states and 8070 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:35,130 INFO L93 Difference]: Finished difference Result 2675 states and 9847 transitions. [2025-04-13 22:23:35,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:23:35,130 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 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 42 [2025-04-13 22:23:35,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:35,136 INFO L225 Difference]: With dead ends: 2675 [2025-04-13 22:23:35,137 INFO L226 Difference]: Without dead ends: 2561 [2025-04-13 22:23:35,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=586, Invalid=4101, Unknown=5, NotChecked=0, Total=4692 [2025-04-13 22:23:35,137 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:35,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:23:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-04-13 22:23:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2137. [2025-04-13 22:23:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 3.8459737827715355) internal successors, (8215), 2136 states have internal predecessors, (8215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 8215 transitions. [2025-04-13 22:23:38,672 INFO L79 Accepts]: Start accepts. Automaton has 2137 states and 8215 transitions. Word has length 42 [2025-04-13 22:23:38,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:38,672 INFO L485 AbstractCegarLoop]: Abstraction has 2137 states and 8215 transitions. [2025-04-13 22:23:38,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:38,673 INFO L278 IsEmpty]: Start isEmpty. Operand 2137 states and 8215 transitions. [2025-04-13 22:23:38,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:23:38,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:38,676 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:38,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:38,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 22:23:38,876 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:23:38,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 958876319, now seen corresponding path program 29 times [2025-04-13 22:23:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:38,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22170569] [2025-04-13 22:23:38,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:38,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:23:38,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:23:38,925 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:38,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:23:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:40,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22170569] [2025-04-13 22:23:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22170569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:40,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742324513] [2025-04-13 22:23:40,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:40,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:40,103 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:40,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 22:23:40,288 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:23:40,939 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:23:40,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:40,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:40,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:23:40,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:41,296 INFO L325 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2025-04-13 22:23:41,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 36 [2025-04-13 22:23:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:41,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:42,342 INFO L325 Elim1Store]: treesize reduction 28, result has 84.5 percent of original size [2025-04-13 22:23:42,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 184 [2025-04-13 22:23:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742324513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:42,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2025-04-13 22:23:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057558214] [2025-04-13 22:23:42,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:42,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:23:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:42,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:23:42,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:23:42,808 INFO L87 Difference]: Start difference. First operand 2137 states and 8215 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:53,738 INFO L93 Difference]: Finished difference Result 2692 states and 10145 transitions. [2025-04-13 22:23:53,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:23:53,739 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 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 42 [2025-04-13 22:23:53,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:53,745 INFO L225 Difference]: With dead ends: 2692 [2025-04-13 22:23:53,746 INFO L226 Difference]: Without dead ends: 2616 [2025-04-13 22:23:53,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=531, Invalid=3501, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:23:53,746 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:53,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 0 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:23:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-04-13 22:23:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2172. [2025-04-13 22:23:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 3.839705204974666) internal successors, (8336), 2171 states have internal predecessors, (8336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8336 transitions. [2025-04-13 22:23:57,480 INFO L79 Accepts]: Start accepts. Automaton has 2172 states and 8336 transitions. Word has length 42 [2025-04-13 22:23:57,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:57,480 INFO L485 AbstractCegarLoop]: Abstraction has 2172 states and 8336 transitions. [2025-04-13 22:23:57,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:57,481 INFO L278 IsEmpty]: Start isEmpty. Operand 2172 states and 8336 transitions. [2025-04-13 22:23:57,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:23:57,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:57,484 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:57,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:57,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 22:23:57,684 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:23:57,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1062548999, now seen corresponding path program 30 times [2025-04-13 22:23:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:57,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642019113] [2025-04-13 22:23:57,685 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:57,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:23:57,713 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:23:57,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:23:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:58,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642019113] [2025-04-13 22:23:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642019113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:58,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755901635] [2025-04-13 22:23:58,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:58,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:58,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:58,347 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:58,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 22:23:58,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:23:58,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 22:23:58,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:23:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:23:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:58,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:58,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 22:23:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:23:58,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:59,837 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:23:59,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:24:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:24:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755901635] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:00,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 29 [2025-04-13 22:24:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768866698] [2025-04-13 22:24:00,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:00,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:24:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:00,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:24:00,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:24:00,101 INFO L87 Difference]: Start difference. First operand 2172 states and 8336 transitions. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:08,104 INFO L93 Difference]: Finished difference Result 2505 states and 9518 transitions. [2025-04-13 22:24:08,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:24:08,104 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2025-04-13 22:24:08,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:08,110 INFO L225 Difference]: With dead ends: 2505 [2025-04-13 22:24:08,111 INFO L226 Difference]: Without dead ends: 2491 [2025-04-13 22:24:08,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:24:08,111 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:08,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:24:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2025-04-13 22:24:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 2169. [2025-04-13 22:24:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 3.841328413284133) internal successors, (8328), 2168 states have internal predecessors, (8328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 8328 transitions. [2025-04-13 22:24:11,874 INFO L79 Accepts]: Start accepts. Automaton has 2169 states and 8328 transitions. Word has length 42 [2025-04-13 22:24:11,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:11,874 INFO L485 AbstractCegarLoop]: Abstraction has 2169 states and 8328 transitions. [2025-04-13 22:24:11,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:11,875 INFO L278 IsEmpty]: Start isEmpty. Operand 2169 states and 8328 transitions. [2025-04-13 22:24:11,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:24:11,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:11,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:11,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 22:24:12,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 22:24:12,078 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:12,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash -655794707, now seen corresponding path program 31 times [2025-04-13 22:24:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:12,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331943719] [2025-04-13 22:24:12,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:12,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:24:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:24:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:24:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:13,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331943719] [2025-04-13 22:24:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331943719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:13,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413454820] [2025-04-13 22:24:13,811 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:13,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:13,813 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 22:24:14,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:24:14,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:24:14,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:14,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:14,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:24:14,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:14,264 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 22:24:14,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:24:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:24:14,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:39,819 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:24:39,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:24:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:24:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413454820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:40,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10, 10] total 44 [2025-04-13 22:24:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059881945] [2025-04-13 22:24:40,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:40,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 22:24:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:40,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 22:24:40,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1793, Unknown=6, NotChecked=0, Total=1980 [2025-04-13 22:24:40,870 INFO L87 Difference]: Start difference. First operand 2169 states and 8328 transitions. Second operand has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:52,293 INFO L93 Difference]: Finished difference Result 2744 states and 10224 transitions. [2025-04-13 22:24:52,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:24:52,294 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 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 42 [2025-04-13 22:24:52,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:52,300 INFO L225 Difference]: With dead ends: 2744 [2025-04-13 22:24:52,301 INFO L226 Difference]: Without dead ends: 2635 [2025-04-13 22:24:52,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=629, Invalid=5217, Unknown=6, NotChecked=0, Total=5852 [2025-04-13 22:24:52,301 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:52,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:24:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-04-13 22:24:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2199. [2025-04-13 22:24:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 2198 states have (on average 3.83803457688808) internal successors, (8436), 2198 states have internal predecessors, (8436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 8436 transitions. [2025-04-13 22:24:56,155 INFO L79 Accepts]: Start accepts. Automaton has 2199 states and 8436 transitions. Word has length 42 [2025-04-13 22:24:56,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:56,155 INFO L485 AbstractCegarLoop]: Abstraction has 2199 states and 8436 transitions. [2025-04-13 22:24:56,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:56,155 INFO L278 IsEmpty]: Start isEmpty. Operand 2199 states and 8436 transitions. [2025-04-13 22:24:56,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:24:56,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:56,159 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:56,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:56,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-13 22:24:56,359 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:24:56,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -674228733, now seen corresponding path program 32 times [2025-04-13 22:24:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:56,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095537325] [2025-04-13 22:24:56,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:56,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:24:56,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:24:56,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:56,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:24:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:57,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095537325] [2025-04-13 22:24:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095537325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:57,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208203803] [2025-04-13 22:24:57,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:57,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:57,673 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:57,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 22:24:57,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:24:57,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:24:57,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:57,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:57,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:24:57,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:58,291 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:24:58,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:24:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:24:58,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:59,889 INFO L325 Elim1Store]: treesize reduction 28, result has 93.2 percent of original size [2025-04-13 22:24:59,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 204 treesize of output 440 [2025-04-13 22:25:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:25:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208203803] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:09,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 10] total 39 [2025-04-13 22:25:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572325967] [2025-04-13 22:25:09,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:09,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:25:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:09,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:25:09,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:25:09,243 INFO L87 Difference]: Start difference. First operand 2199 states and 8436 transitions. Second operand has 40 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:20,246 INFO L93 Difference]: Finished difference Result 3030 states and 11578 transitions. [2025-04-13 22:25:20,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:25:20,247 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 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 42 [2025-04-13 22:25:20,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:20,255 INFO L225 Difference]: With dead ends: 3030 [2025-04-13 22:25:20,255 INFO L226 Difference]: Without dead ends: 3003 [2025-04-13 22:25:20,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=536, Invalid=3754, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:25:20,256 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:20,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:25:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2025-04-13 22:25:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2229. [2025-04-13 22:25:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2228 states have (on average 3.8402154398563733) internal successors, (8556), 2228 states have internal predecessors, (8556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 8556 transitions. [2025-04-13 22:25:24,182 INFO L79 Accepts]: Start accepts. Automaton has 2229 states and 8556 transitions. Word has length 42 [2025-04-13 22:25:24,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:24,182 INFO L485 AbstractCegarLoop]: Abstraction has 2229 states and 8556 transitions. [2025-04-13 22:25:24,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:24,182 INFO L278 IsEmpty]: Start isEmpty. Operand 2229 states and 8556 transitions. [2025-04-13 22:25:24,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:25:24,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:24,186 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:24,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:24,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:24,387 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:25:24,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2035812735, now seen corresponding path program 33 times [2025-04-13 22:25:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:24,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594995065] [2025-04-13 22:25:24,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:24,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:25:24,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 22:25:24,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:25:24,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:25:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:25,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594995065] [2025-04-13 22:25:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594995065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:25,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842322395] [2025-04-13 22:25:25,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:25,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:25,079 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:25,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 22:25:25,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:25:25,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 22:25:25,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:25:25,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:25,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:25:25,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:25,701 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 22:25:25,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 22:25:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:25:25,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:26,771 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:25:26,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:25:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:25:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842322395] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:26,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 22:25:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786280702] [2025-04-13 22:25:26,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:26,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:25:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:26,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:25:26,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:25:26,931 INFO L87 Difference]: Start difference. First operand 2229 states and 8556 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:34,934 INFO L93 Difference]: Finished difference Result 2476 states and 9393 transitions. [2025-04-13 22:25:34,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:25:34,935 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2025-04-13 22:25:34,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:34,941 INFO L225 Difference]: With dead ends: 2476 [2025-04-13 22:25:34,941 INFO L226 Difference]: Without dead ends: 2413 [2025-04-13 22:25:34,941 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:25:34,942 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:34,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:25:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2025-04-13 22:25:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2253. [2025-04-13 22:25:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2252 states have (on average 3.836145648312611) internal successors, (8639), 2252 states have internal predecessors, (8639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8639 transitions. [2025-04-13 22:25:38,901 INFO L79 Accepts]: Start accepts. Automaton has 2253 states and 8639 transitions. Word has length 42 [2025-04-13 22:25:38,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:38,901 INFO L485 AbstractCegarLoop]: Abstraction has 2253 states and 8639 transitions. [2025-04-13 22:25:38,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:38,901 INFO L278 IsEmpty]: Start isEmpty. Operand 2253 states and 8639 transitions. [2025-04-13 22:25:38,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:25:38,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:38,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:38,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 22:25:39,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-13 22:25:39,105 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:25:39,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2139485415, now seen corresponding path program 34 times [2025-04-13 22:25:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:39,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832266650] [2025-04-13 22:25:39,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:39,116 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:25:39,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:25:39,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 22:25:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:40,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832266650] [2025-04-13 22:25:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832266650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:40,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983917337] [2025-04-13 22:25:40,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:40,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:40,496 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:40,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 22:25:40,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:25:40,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:25:40,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:40,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:40,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:25:40,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:40,997 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 22:25:40,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:25:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:25:41,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:06,344 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 22:26:06,344 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 187 [2025-04-13 22:26:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:26:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983917337] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:08,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2025-04-13 22:26:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81395660] [2025-04-13 22:26:08,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:08,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:08,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:08,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=946, Unknown=6, NotChecked=0, Total=1056 [2025-04-13 22:26:08,095 INFO L87 Difference]: Start difference. First operand 2253 states and 8639 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:22,651 INFO L93 Difference]: Finished difference Result 2853 states and 10589 transitions. [2025-04-13 22:26:22,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:26:22,651 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 42 [2025-04-13 22:26:22,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:22,660 INFO L225 Difference]: With dead ends: 2853 [2025-04-13 22:26:22,660 INFO L226 Difference]: Without dead ends: 2722 [2025-04-13 22:26:22,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=591, Invalid=4373, Unknown=6, NotChecked=0, Total=4970 [2025-04-13 22:26:22,661 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 365 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:22,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 0 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 22:26:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-04-13 22:26:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2311. [2025-04-13 22:26:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2310 states have (on average 3.83030303030303) internal successors, (8848), 2310 states have internal predecessors, (8848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 8848 transitions. [2025-04-13 22:26:26,946 INFO L79 Accepts]: Start accepts. Automaton has 2311 states and 8848 transitions. Word has length 42 [2025-04-13 22:26:26,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:26,946 INFO L485 AbstractCegarLoop]: Abstraction has 2311 states and 8848 transitions. [2025-04-13 22:26:26,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:26,946 INFO L278 IsEmpty]: Start isEmpty. Operand 2311 states and 8848 transitions. [2025-04-13 22:26:26,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:26:26,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:26,950 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:26,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 22:26:27,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:27,151 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:26:27,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 421141709, now seen corresponding path program 35 times [2025-04-13 22:26:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:27,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518109650] [2025-04-13 22:26:27,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:27,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:26:27,203 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:26:27,204 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:26:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:26:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:28,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518109650] [2025-04-13 22:26:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518109650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:28,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037813892] [2025-04-13 22:26:28,279 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:28,280 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 22:26:28,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 22:26:28,767 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:26:28,767 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:26:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:28,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:26:28,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:29,150 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 22:26:29,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2025-04-13 22:26:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 22:26:29,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:30,372 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 22:26:30,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-04-13 22:26:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 22:26:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037813892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:30,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 37 [2025-04-13 22:26:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142335845] [2025-04-13 22:26:30,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:30,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:26:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:30,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:26:30,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:26:30,579 INFO L87 Difference]: Start difference. First operand 2311 states and 8848 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 22:26:36,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:26:36,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=721, Invalid=4979, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:26:36,613 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 409 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:36,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 0 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:26:36,614 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:26:36,617 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 22:26:36,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 22:26:36,645 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:26:36,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:36,815 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2311states) and FLOYD_HOARE automaton (currently 41 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (1004 states constructed, input type IntersectNwa). [2025-04-13 22:26:36,816 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:26:36,816 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:26:36,817 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:26:36,819 INFO L422 BasicCegarLoop]: Path program histogram: [35, 7, 6, 5, 1, 1] [2025-04-13 22:26:36,820 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:26:36,820 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:26:36,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:26:36 BasicIcfg [2025-04-13 22:26:36,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:26:36,822 INFO L158 Benchmark]: Toolchain (without parser) took 846464.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 103.5MB in the beginning and 788.9MB in the end (delta: -685.4MB). Peak memory consumption was 276.6MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,822 INFO L158 Benchmark]: CDTParser took 0.19ms. 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 22:26:36,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.76ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 87.4MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,822 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,822 INFO L158 Benchmark]: IcfgBuilder took 710.27ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 55.0MB in the end (delta: 27.3MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,822 INFO L158 Benchmark]: TraceAbstraction took 845361.76ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 54.3MB in the beginning and 788.9MB in the end (delta: -734.6MB). Peak memory consumption was 227.6MB. Max. memory is 8.0GB. [2025-04-13 22:26:36,823 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.76ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 87.4MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 710.27ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 55.0MB in the end (delta: 27.3MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 845361.76ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 54.3MB in the beginning and 788.9MB in the end (delta: -734.6MB). Peak memory consumption was 227.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (2311states) and FLOYD_HOARE automaton (currently 41 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (1004 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2311states) and FLOYD_HOARE automaton (currently 41 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (1004 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2311states) and FLOYD_HOARE automaton (currently 41 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (1004 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2311states) and FLOYD_HOARE automaton (currently 41 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (1004 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 45 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 845.3s, OverallIterations: 55, TraceHistogramMax: 5, PathProgramHistogramMax: 35, EmptinessCheckTime: 0.1s, AutomataDifference: 341.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 13685 SdHoareTripleChecker+Valid, 107.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13685 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 102.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1858 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71214 IncrementalHoareTripleChecker+Invalid, 73084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1858 mSolverCounterUnsat, 0 mSDtfsCounter, 71214 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6215 GetRequests, 3845 SyntacticMatches, 8 SemanticMatches, 2362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41917 ImplicationChecksByTransitivity, 383.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2311occurred in iteration=54, InterpolantAutomatonStates: 1341, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.3s AutomataMinimizationTime, 54 MinimizatonAttempts, 16438 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 416.3s InterpolantComputationTime, 4029 NumberOfCodeBlocks, 3827 NumberOfCodeBlocksAsserted, 242 NumberOfCheckSat, 5659 ConstructedInterpolants, 317 QuantifiedInterpolants, 105557 SizeOfPredicates, 786 NumberOfNonLiveVariables, 21051 ConjunctsInSsa, 1630 ConjunctsInUnsatCore, 146 InterpolantComputations, 16 PerfectInterpolantSequences, 6943/7889 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