/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/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:45:13,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:45:13,910 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:45:13,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:45:13,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:45:13,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:45:13,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:45:13,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:45:13,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:45:13,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:45:13,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:45:13,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:45:13,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:45:13,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:45:13,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:45:13,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:45:13,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:45:13,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:45:13,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:45:13,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:45:13,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:45:13,942 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:45:14,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:45:14,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:45:14,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:45:14,180 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:45:14,181 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:45:14,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-04-13 22:45:15,551 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ea50807/51addf12859442b28b950c2961b11c0f/FLAG0edffaef5 [2025-04-13 22:45:15,777 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:45:15,777 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-04-13 22:45:15,783 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ea50807/51addf12859442b28b950c2961b11c0f/FLAG0edffaef5 [2025-04-13 22:45:16,553 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ea50807/51addf12859442b28b950c2961b11c0f [2025-04-13 22:45:16,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:45:16,556 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:45:16,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:45:16,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:45:16,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:45:16,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51df728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16, skipping insertion in model container [2025-04-13 22:45:16,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:45:16,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-04-13 22:45:16,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:45:16,766 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:45:16,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-04-13 22:45:16,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:45:16,818 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:45:16,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16 WrapperNode [2025-04-13 22:45:16,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:45:16,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:45:16,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:45:16,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:45:16,825 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:45:16" (1/1) ... [2025-04-13 22:45:16,832 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:45:16" (1/1) ... [2025-04-13 22:45:16,851 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 128 [2025-04-13 22:45:16,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:45:16,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:45:16,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:45:16,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:45:16,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,878 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 22:45:16,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:45:16,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:45:16,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:45:16,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:45:16,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (1/1) ... [2025-04-13 22:45:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:45:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:16,918 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:45:16,920 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:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:45:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:45:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:45:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:45:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:45:16,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:45:16,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:45:16,937 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:45:17,009 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:45:17,010 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:45:17,189 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:45:17,190 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:45:17,190 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:45:17,375 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:45:17,378 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:45:17,403 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:45:17,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:45:17 BoogieIcfgContainer [2025-04-13 22:45:17,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:45:17,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:45:17,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:45:17,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:45:17,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:45:16" (1/3) ... [2025-04-13 22:45:17,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b500849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:45:17, skipping insertion in model container [2025-04-13 22:45:17,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:45:16" (2/3) ... [2025-04-13 22:45:17,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b500849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:45:17, skipping insertion in model container [2025-04-13 22:45:17,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:45:17" (3/3) ... [2025-04-13 22:45:17,412 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-04-13 22:45:17,422 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:45:17,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 25 locations, 31 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 22:45:17,424 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:45:17,494 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:45:17,521 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 33 transitions, 80 flow [2025-04-13 22:45:17,538 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 71 states, 70 states have (on average 3.1) internal successors, (217), 70 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have 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:45:17,563 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:45:17,572 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;@423dbc3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:45:17,572 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:45:17,575 INFO L278 IsEmpty]: Start isEmpty. Operand has 71 states, 70 states have (on average 3.1) internal successors, (217), 70 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have 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:45:17,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:45:17,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:17,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:17,580 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:17,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1559622060, now seen corresponding path program 1 times [2025-04-13 22:45:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:17,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347392308] [2025-04-13 22:45:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:17,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:45:17,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:45:17,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:17,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:17,854 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:45:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:17,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347392308] [2025-04-13 22:45:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347392308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:45:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647442546] [2025-04-13 22:45:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:17,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:45:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:17,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:45:17,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:45:17,878 INFO L87 Difference]: Start difference. First operand has 71 states, 70 states have (on average 3.1) internal successors, (217), 70 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:17,977 INFO L93 Difference]: Finished difference Result 167 states and 517 transitions. [2025-04-13 22:45:17,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:45:17,980 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 22:45:17,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:17,990 INFO L225 Difference]: With dead ends: 167 [2025-04-13 22:45:17,990 INFO L226 Difference]: Without dead ends: 99 [2025-04-13 22:45:17,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:45:17,994 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:17,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-13 22:45:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2025-04-13 22:45:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 2.7714285714285714) internal successors, (194), 70 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:45:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 194 transitions. [2025-04-13 22:45:18,029 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 194 transitions. Word has length 15 [2025-04-13 22:45:18,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:18,029 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 194 transitions. [2025-04-13 22:45:18,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,029 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 194 transitions. [2025-04-13 22:45:18,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:45:18,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:18,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:18,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:45:18,032 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:18,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1601361518, now seen corresponding path program 1 times [2025-04-13 22:45:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:18,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577442454] [2025-04-13 22:45:18,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:18,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:45:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:45:18,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:18,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:18,128 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:45:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:18,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577442454] [2025-04-13 22:45:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577442454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:45:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557624738] [2025-04-13 22:45:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:18,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:45:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:18,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:45:18,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:45:18,130 INFO L87 Difference]: Start difference. First operand 71 states and 194 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:18,204 INFO L93 Difference]: Finished difference Result 129 states and 346 transitions. [2025-04-13 22:45:18,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:45:18,205 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:45:18,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:18,205 INFO L225 Difference]: With dead ends: 129 [2025-04-13 22:45:18,205 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 22:45:18,206 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:45:18,206 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:18,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 22:45:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2025-04-13 22:45:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.6271186440677967) internal successors, (155), 59 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:45:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 155 transitions. [2025-04-13 22:45:18,216 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 155 transitions. Word has length 17 [2025-04-13 22:45:18,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:18,216 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 155 transitions. [2025-04-13 22:45:18,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,216 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 155 transitions. [2025-04-13 22:45:18,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:45:18,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:18,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:18,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:45:18,217 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:18,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 988583649, now seen corresponding path program 1 times [2025-04-13 22:45:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:18,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286734329] [2025-04-13 22:45:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:18,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:45:18,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:45:18,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:18,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:18,412 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:45:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:18,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286734329] [2025-04-13 22:45:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286734329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:45:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480084745] [2025-04-13 22:45:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:18,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:45:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:18,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:45:18,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:45:18,414 INFO L87 Difference]: Start difference. First operand 60 states and 155 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:18,471 INFO L93 Difference]: Finished difference Result 115 states and 305 transitions. [2025-04-13 22:45:18,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:45:18,472 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:45:18,472 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:18,472 INFO L225 Difference]: With dead ends: 115 [2025-04-13 22:45:18,472 INFO L226 Difference]: Without dead ends: 61 [2025-04-13 22:45:18,473 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:45:18,473 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:18,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-13 22:45:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-13 22:45:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.6) internal successors, (156), 60 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:45:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 156 transitions. [2025-04-13 22:45:18,477 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 156 transitions. Word has length 19 [2025-04-13 22:45:18,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:18,477 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 156 transitions. [2025-04-13 22:45:18,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,477 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 156 transitions. [2025-04-13 22:45:18,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:45:18,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:18,478 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:45:18,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:45:18,478 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:18,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1027177232, now seen corresponding path program 1 times [2025-04-13 22:45:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:18,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163058921] [2025-04-13 22:45:18,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:18,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:45:18,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:45:18,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:18,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:19,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163058921] [2025-04-13 22:45:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163058921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:19,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108799410] [2025-04-13 22:45:19,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:19,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:19,018 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:45:19,019 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:45:19,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:45:19,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:45:19,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:19,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:45:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:19,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:45:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:19,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:19,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-04-13 22:45:19,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:19,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 68 [2025-04-13 22:45:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108799410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:19,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-04-13 22:45:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455992341] [2025-04-13 22:45:19,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:19,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:45:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:19,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:45:19,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:45:19,778 INFO L87 Difference]: Start difference. First operand 61 states and 156 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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:45:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:20,723 INFO L93 Difference]: Finished difference Result 301 states and 877 transitions. [2025-04-13 22:45:20,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:45:20,724 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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 20 [2025-04-13 22:45:20,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:20,726 INFO L225 Difference]: With dead ends: 301 [2025-04-13 22:45:20,726 INFO L226 Difference]: Without dead ends: 216 [2025-04-13 22:45:20,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=596, Invalid=1756, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:45:20,729 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 360 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:20,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 9 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:45:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-13 22:45:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 95. [2025-04-13 22:45:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.6382978723404253) internal successors, (248), 94 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have 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:45:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 248 transitions. [2025-04-13 22:45:20,744 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 248 transitions. Word has length 20 [2025-04-13 22:45:20,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:20,745 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 248 transitions. [2025-04-13 22:45:20,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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:45:20,745 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 248 transitions. [2025-04-13 22:45:20,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:45:20,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:20,746 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:20,753 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:45:20,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:20,947 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:20,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash -233320722, now seen corresponding path program 1 times [2025-04-13 22:45:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:20,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800642796] [2025-04-13 22:45:20,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:20,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:45:20,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:45:20,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:21,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800642796] [2025-04-13 22:45:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800642796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:45:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150811506] [2025-04-13 22:45:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:21,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:45:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:45:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:45:21,005 INFO L87 Difference]: Start difference. First operand 95 states and 248 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:45:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:21,069 INFO L93 Difference]: Finished difference Result 240 states and 663 transitions. [2025-04-13 22:45:21,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:45:21,069 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-04-13 22:45:21,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:21,071 INFO L225 Difference]: With dead ends: 240 [2025-04-13 22:45:21,071 INFO L226 Difference]: Without dead ends: 197 [2025-04-13 22:45:21,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:45:21,071 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:21,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-13 22:45:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 161. [2025-04-13 22:45:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.78125) internal successors, (445), 160 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have 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:45:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2025-04-13 22:45:21,088 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 22 [2025-04-13 22:45:21,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:21,088 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2025-04-13 22:45:21,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:45:21,089 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2025-04-13 22:45:21,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:45:21,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:21,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:21,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:45:21,090 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:21,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1176812725, now seen corresponding path program 1 times [2025-04-13 22:45:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:21,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127062572] [2025-04-13 22:45:21,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:21,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:45:21,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:45:21,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:21,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:21,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127062572] [2025-04-13 22:45:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127062572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:21,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723140750] [2025-04-13 22:45:21,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:21,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:21,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:21,225 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:45:21,227 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:45:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:45:21,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:45:21,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:21,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:21,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:45:21,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:21,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723140750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:21,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 22:45:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443521050] [2025-04-13 22:45:21,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:21,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:45:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:45:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:45:21,445 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) 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:45:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:21,686 INFO L93 Difference]: Finished difference Result 258 states and 735 transitions. [2025-04-13 22:45:21,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:45:21,687 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) 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 24 [2025-04-13 22:45:21,687 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:21,688 INFO L225 Difference]: With dead ends: 258 [2025-04-13 22:45:21,688 INFO L226 Difference]: Without dead ends: 140 [2025-04-13 22:45:21,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:45:21,689 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:21,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:45:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-04-13 22:45:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-04-13 22:45:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.8633093525179856) internal successors, (398), 139 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have 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:45:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 398 transitions. [2025-04-13 22:45:21,696 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 398 transitions. Word has length 24 [2025-04-13 22:45:21,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:21,696 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 398 transitions. [2025-04-13 22:45:21,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) 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:45:21,696 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 398 transitions. [2025-04-13 22:45:21,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:45:21,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:21,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:21,703 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:45:21,897 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:45:21,898 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:21,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1822344860, now seen corresponding path program 2 times [2025-04-13 22:45:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:21,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608842760] [2025-04-13 22:45:21,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:45:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:21,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:45:21,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:21,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:45:21,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:45:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:22,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608842760] [2025-04-13 22:45:22,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608842760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:22,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:22,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:45:22,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133678337] [2025-04-13 22:45:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:22,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:45:22,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:22,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:45:22,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:45:22,039 INFO L87 Difference]: Start difference. First operand 140 states and 398 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:45:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:22,077 INFO L93 Difference]: Finished difference Result 243 states and 715 transitions. [2025-04-13 22:45:22,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:45:22,077 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 25 [2025-04-13 22:45:22,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:22,078 INFO L225 Difference]: With dead ends: 243 [2025-04-13 22:45:22,078 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 22:45:22,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:45:22,079 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:22,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:45:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 22:45:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-04-13 22:45:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.6793893129770994) internal successors, (351), 131 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have 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:45:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 351 transitions. [2025-04-13 22:45:22,087 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 351 transitions. Word has length 25 [2025-04-13 22:45:22,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:22,087 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 351 transitions. [2025-04-13 22:45:22,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:45:22,087 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 351 transitions. [2025-04-13 22:45:22,091 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:45:22,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:22,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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:45:22,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:45:22,091 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:22,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash -178852545, now seen corresponding path program 1 times [2025-04-13 22:45:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:22,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110565763] [2025-04-13 22:45:22,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:22,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:45:22,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:22,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:22,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:22,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110565763] [2025-04-13 22:45:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110565763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:22,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129991632] [2025-04-13 22:45:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:22,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:22,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:22,951 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:45:22,952 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:45:22,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:45:23,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:23,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:23,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:23,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:45:23,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:23,441 INFO L325 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-04-13 22:45:23,442 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 48 treesize of output 21 [2025-04-13 22:45:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:23,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:23,794 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 22:45:23,794 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 74 treesize of output 60 [2025-04-13 22:45:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129991632] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:24,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-04-13 22:45:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92984379] [2025-04-13 22:45:24,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:24,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:45:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:24,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:45:24,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:45:24,248 INFO L87 Difference]: Start difference. First operand 132 states and 351 transitions. Second operand has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 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:45:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:33,479 INFO L93 Difference]: Finished difference Result 1281 states and 3548 transitions. [2025-04-13 22:45:33,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 22:45:33,479 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 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 25 [2025-04-13 22:45:33,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:33,484 INFO L225 Difference]: With dead ends: 1281 [2025-04-13 22:45:33,484 INFO L226 Difference]: Without dead ends: 934 [2025-04-13 22:45:33,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9226 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=4495, Invalid=20310, Unknown=1, NotChecked=0, Total=24806 [2025-04-13 22:45:33,489 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 984 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 509 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:33,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 10 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2900 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 22:45:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-04-13 22:45:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 302. [2025-04-13 22:45:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.8538205980066444) internal successors, (859), 301 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have 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:45:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 859 transitions. [2025-04-13 22:45:33,505 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 859 transitions. Word has length 25 [2025-04-13 22:45:33,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:33,505 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 859 transitions. [2025-04-13 22:45:33,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 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:45:33,506 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 859 transitions. [2025-04-13 22:45:33,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:45:33,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:33,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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:45:33,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:45:33,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:33,707 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:33,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 996638099, now seen corresponding path program 2 times [2025-04-13 22:45:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:33,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691361386] [2025-04-13 22:45:33,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:45:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:33,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:45:33,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:33,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:45:33,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:34,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691361386] [2025-04-13 22:45:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691361386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:34,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866864267] [2025-04-13 22:45:34,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:45:34,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:34,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:34,186 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:45:34,187 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:45:34,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:45:34,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:34,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:45:34,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:34,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:45:34,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:34,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:45:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:34,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:34,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-04-13 22:45:34,835 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:34,836 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 229 treesize of output 200 [2025-04-13 22:45:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866864267] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:35,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:35,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2025-04-13 22:45:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297996537] [2025-04-13 22:45:35,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:35,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:45:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:35,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:45:35,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:45:35,617 INFO L87 Difference]: Start difference. First operand 302 states and 859 transitions. Second operand has 38 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 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:45:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:46,955 INFO L93 Difference]: Finished difference Result 2227 states and 6269 transitions. [2025-04-13 22:45:46,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2025-04-13 22:45:46,955 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 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 25 [2025-04-13 22:45:46,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:46,964 INFO L225 Difference]: With dead ends: 2227 [2025-04-13 22:45:46,964 INFO L226 Difference]: Without dead ends: 1779 [2025-04-13 22:45:46,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26595 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=7722, Invalid=54528, Unknown=0, NotChecked=0, Total=62250 [2025-04-13 22:45:46,974 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1045 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4542 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 4978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 4542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:46,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 21 Invalid, 4978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 4542 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 22:45:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-04-13 22:45:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 446. [2025-04-13 22:45:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.9415730337078654) internal successors, (1309), 445 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have 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:45:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1309 transitions. [2025-04-13 22:45:46,999 INFO L79 Accepts]: Start accepts. Automaton has 446 states and 1309 transitions. Word has length 25 [2025-04-13 22:45:46,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:46,999 INFO L485 AbstractCegarLoop]: Abstraction has 446 states and 1309 transitions. [2025-04-13 22:45:46,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 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:45:46,999 INFO L278 IsEmpty]: Start isEmpty. Operand 446 states and 1309 transitions. [2025-04-13 22:45:47,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:45:47,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:47,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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:45:47,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 22:45:47,205 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:45:47,205 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:47,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 708176477, now seen corresponding path program 3 times [2025-04-13 22:45:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:47,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108579665] [2025-04-13 22:45:47,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:45:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:47,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:45:47,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:47,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:45:47,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:47,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108579665] [2025-04-13 22:45:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108579665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:47,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112180348] [2025-04-13 22:45:47,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:45:47,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:47,696 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:45:47,697 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:45:47,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:45:47,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:45:47,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:45:47,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:47,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:45:47,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:47,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:45:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:48,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:48,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-04-13 22:45:48,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:48,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 229 treesize of output 200 [2025-04-13 22:45:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:48,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112180348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:48,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:48,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2025-04-13 22:45:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117871595] [2025-04-13 22:45:48,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:48,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:45:48,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:48,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:45:48,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:45:48,829 INFO L87 Difference]: Start difference. First operand 446 states and 1309 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:52,135 INFO L93 Difference]: Finished difference Result 1611 states and 4627 transitions. [2025-04-13 22:45:52,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-13 22:45:52,136 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:45:52,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:52,142 INFO L225 Difference]: With dead ends: 1611 [2025-04-13 22:45:52,142 INFO L226 Difference]: Without dead ends: 1356 [2025-04-13 22:45:52,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6371 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2409, Invalid=13847, Unknown=0, NotChecked=0, Total=16256 [2025-04-13 22:45:52,144 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 631 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:52,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 14 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:45:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-04-13 22:45:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 422. [2025-04-13 22:45:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.862232779097387) internal successors, (1205), 421 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have 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:45:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1205 transitions. [2025-04-13 22:45:52,161 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1205 transitions. Word has length 25 [2025-04-13 22:45:52,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:52,162 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1205 transitions. [2025-04-13 22:45:52,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:52,162 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1205 transitions. [2025-04-13 22:45:52,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:45:52,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:52,163 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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:45:52,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:45:52,367 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,SelfDestructingSolverStorable9 [2025-04-13 22:45:52,367 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:52,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1694247922, now seen corresponding path program 4 times [2025-04-13 22:45:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:52,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906187456] [2025-04-13 22:45:52,368 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:45:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:52,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:45:52,393 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:45:52,393 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:45:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:52,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906187456] [2025-04-13 22:45:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906187456] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:52,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234989121] [2025-04-13 22:45:52,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:45:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:52,605 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:45:52,607 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:45:52,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:45:52,670 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:45:52,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:45:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:52,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:45:52,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:52,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:53,042 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:53,042 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 75 treesize of output 60 [2025-04-13 22:45:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234989121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:53,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:45:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898512819] [2025-04-13 22:45:53,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:53,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:45:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:53,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:45:53,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:45:53,110 INFO L87 Difference]: Start difference. First operand 422 states and 1205 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:55,408 INFO L93 Difference]: Finished difference Result 1233 states and 3614 transitions. [2025-04-13 22:45:55,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 22:45:55,408 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:45:55,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:55,417 INFO L225 Difference]: With dead ends: 1233 [2025-04-13 22:45:55,417 INFO L226 Difference]: Without dead ends: 1188 [2025-04-13 22:45:55,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3483 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1618, Invalid=7888, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 22:45:55,418 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 437 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:55,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 15 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:45:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-04-13 22:45:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 594. [2025-04-13 22:45:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 2.93929173693086) internal successors, (1743), 593 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have 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:45:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1743 transitions. [2025-04-13 22:45:55,437 INFO L79 Accepts]: Start accepts. Automaton has 594 states and 1743 transitions. Word has length 26 [2025-04-13 22:45:55,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:55,437 INFO L485 AbstractCegarLoop]: Abstraction has 594 states and 1743 transitions. [2025-04-13 22:45:55,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:45:55,438 INFO L278 IsEmpty]: Start isEmpty. Operand 594 states and 1743 transitions. [2025-04-13 22:45:55,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:45:55,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:55,439 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:55,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:45:55,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:55,642 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:55,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1265590755, now seen corresponding path program 5 times [2025-04-13 22:45:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:55,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918201134] [2025-04-13 22:45:55,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:45:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:55,649 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:45:55,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:45:55,654 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:45:55,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:55,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918201134] [2025-04-13 22:45:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918201134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:55,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090601688] [2025-04-13 22:45:55,749 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:45:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:55,751 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:45:55,753 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:45:55,793 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:45:55,811 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:45:55,811 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:45:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:55,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:45:55,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:55,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090601688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:55,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:55,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 22:45:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060338552] [2025-04-13 22:45:55,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:55,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:45:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:55,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:45:55,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:45:55,973 INFO L87 Difference]: Start difference. First operand 594 states and 1743 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:56,138 INFO L93 Difference]: Finished difference Result 791 states and 2300 transitions. [2025-04-13 22:45:56,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:45:56,139 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:45:56,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:56,141 INFO L225 Difference]: With dead ends: 791 [2025-04-13 22:45:56,141 INFO L226 Difference]: Without dead ends: 303 [2025-04-13 22:45:56,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:45:56,142 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:56,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-13 22:45:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-04-13 22:45:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.877483443708609) internal successors, (869), 302 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have 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:45:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 869 transitions. [2025-04-13 22:45:56,149 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 869 transitions. Word has length 27 [2025-04-13 22:45:56,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:56,149 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 869 transitions. [2025-04-13 22:45:56,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:56,149 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 869 transitions. [2025-04-13 22:45:56,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:45:56,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:56,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:56,157 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:45:56,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:56,351 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:56,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash 964546802, now seen corresponding path program 6 times [2025-04-13 22:45:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:56,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70057648] [2025-04-13 22:45:56,352 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:45:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:56,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-13 22:45:56,370 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:45:56,371 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:45:56,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:56,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70057648] [2025-04-13 22:45:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70057648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:45:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482317523] [2025-04-13 22:45:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:56,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:45:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:56,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:45:56,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:45:56,418 INFO L87 Difference]: Start difference. First operand 303 states and 869 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:56,482 INFO L93 Difference]: Finished difference Result 653 states and 1882 transitions. [2025-04-13 22:45:56,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:45:56,483 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:45:56,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:56,486 INFO L225 Difference]: With dead ends: 653 [2025-04-13 22:45:56,486 INFO L226 Difference]: Without dead ends: 558 [2025-04-13 22:45:56,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:45:56,487 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:56,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:45:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-04-13 22:45:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 431. [2025-04-13 22:45:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 2.9604651162790696) internal successors, (1273), 430 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have 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:45:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1273 transitions. [2025-04-13 22:45:56,497 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1273 transitions. Word has length 28 [2025-04-13 22:45:56,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:56,497 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1273 transitions. [2025-04-13 22:45:56,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:56,497 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1273 transitions. [2025-04-13 22:45:56,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:45:56,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:56,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:56,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:45:56,499 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:56,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1500587581, now seen corresponding path program 1 times [2025-04-13 22:45:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:56,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330987337] [2025-04-13 22:45:56,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:56,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:45:56,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:45:56,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:56,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:57,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330987337] [2025-04-13 22:45:57,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330987337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:57,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588134009] [2025-04-13 22:45:57,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:45:57,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:57,260 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:45:57,261 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:45:57,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:45:57,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:45:57,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:57,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:45:57,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:45:57,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:57,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:57,996 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 108 treesize of output 114 [2025-04-13 22:45:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588134009] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:58,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 44 [2025-04-13 22:45:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058546805] [2025-04-13 22:45:58,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:58,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:45:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:58,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:45:58,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:45:58,122 INFO L87 Difference]: Start difference. First operand 431 states and 1273 transitions. Second operand has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:46:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:46:04,694 INFO L93 Difference]: Finished difference Result 2610 states and 7536 transitions. [2025-04-13 22:46:04,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-04-13 22:46:04,695 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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 30 [2025-04-13 22:46:04,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:46:04,704 INFO L225 Difference]: With dead ends: 2610 [2025-04-13 22:46:04,704 INFO L226 Difference]: Without dead ends: 2249 [2025-04-13 22:46:04,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14627 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3719, Invalid=33723, Unknown=0, NotChecked=0, Total=37442 [2025-04-13 22:46:04,707 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 663 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:46:04,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 23 Invalid, 3857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 22:46:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2025-04-13 22:46:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 593. [2025-04-13 22:46:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 2.918918918918919) internal successors, (1728), 592 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have 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:46:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1728 transitions. [2025-04-13 22:46:04,731 INFO L79 Accepts]: Start accepts. Automaton has 593 states and 1728 transitions. Word has length 30 [2025-04-13 22:46:04,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:46:04,731 INFO L485 AbstractCegarLoop]: Abstraction has 593 states and 1728 transitions. [2025-04-13 22:46:04,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:46:04,731 INFO L278 IsEmpty]: Start isEmpty. Operand 593 states and 1728 transitions. [2025-04-13 22:46:04,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:46:04,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:46:04,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:46:04,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 22:46:04,936 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,SelfDestructingSolverStorable13 [2025-04-13 22:46:04,936 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:46:04,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:46:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash -750453294, now seen corresponding path program 1 times [2025-04-13 22:46:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:46:04,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457055971] [2025-04-13 22:46:04,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:46:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:46:04,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:46:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:46:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:46:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:46:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:46:04,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457055971] [2025-04-13 22:46:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457055971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:46:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:46:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:46:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003354358] [2025-04-13 22:46:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:46:04,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:46:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:46:04,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:46:04,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:46:04,998 INFO L87 Difference]: Start difference. First operand 593 states and 1728 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:46:05,034 INFO L93 Difference]: Finished difference Result 910 states and 2693 transitions. [2025-04-13 22:46:05,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:46:05,034 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:46:05,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:46:05,039 INFO L225 Difference]: With dead ends: 910 [2025-04-13 22:46:05,039 INFO L226 Difference]: Without dead ends: 482 [2025-04-13 22:46:05,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:05,041 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:46:05,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:46:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-04-13 22:46:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2025-04-13 22:46:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 2.6457023060796647) internal successors, (1262), 477 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have 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:46:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1262 transitions. [2025-04-13 22:46:05,052 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 1262 transitions. Word has length 30 [2025-04-13 22:46:05,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:46:05,052 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 1262 transitions. [2025-04-13 22:46:05,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:05,052 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 1262 transitions. [2025-04-13 22:46:05,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:46:05,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:46:05,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:46:05,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:46:05,054 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:46:05,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:46:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 768994651, now seen corresponding path program 2 times [2025-04-13 22:46:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:46:05,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412492071] [2025-04-13 22:46:05,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:46:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:46:05,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:46:05,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:46:05,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:46:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:46:05,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412492071] [2025-04-13 22:46:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412492071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:46:05,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854357999] [2025-04-13 22:46:05,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:46:05,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:46:05,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:46:05,724 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:46:05,725 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:46:05,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:46:05,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:46:05,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:46:05,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:05,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 22:46:05,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:46:05,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:46:06,310 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:46:06,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 39 [2025-04-13 22:46:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:06,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:46:07,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 192 [2025-04-13 22:46:07,770 INFO L325 Elim1Store]: treesize reduction 64, result has 71.0 percent of original size [2025-04-13 22:46:07,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 538 treesize of output 530 [2025-04-13 22:46:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854357999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:46:35,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:46:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 57 [2025-04-13 22:46:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315817780] [2025-04-13 22:46:35,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:46:35,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-13 22:46:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:46:35,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-13 22:46:35,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=2838, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:46:35,231 INFO L87 Difference]: Start difference. First operand 478 states and 1262 transitions. Second operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 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:46:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:46:57,767 INFO L93 Difference]: Finished difference Result 1948 states and 5198 transitions. [2025-04-13 22:46:57,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2025-04-13 22:46:57,767 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 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 30 [2025-04-13 22:46:57,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:46:57,773 INFO L225 Difference]: With dead ends: 1948 [2025-04-13 22:46:57,773 INFO L226 Difference]: Without dead ends: 1619 [2025-04-13 22:46:57,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20272 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=6910, Invalid=42596, Unknown=0, NotChecked=0, Total=49506 [2025-04-13 22:46:57,776 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1287 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:46:57,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 17 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 22:46:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-04-13 22:46:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 624. [2025-04-13 22:46:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 2.653290529695024) internal successors, (1653), 623 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have 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:46:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1653 transitions. [2025-04-13 22:46:57,791 INFO L79 Accepts]: Start accepts. Automaton has 624 states and 1653 transitions. Word has length 30 [2025-04-13 22:46:57,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:46:57,791 INFO L485 AbstractCegarLoop]: Abstraction has 624 states and 1653 transitions. [2025-04-13 22:46:57,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 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:46:57,791 INFO L278 IsEmpty]: Start isEmpty. Operand 624 states and 1653 transitions. [2025-04-13 22:46:57,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:46:57,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:46:57,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:46:57,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 22:46:57,996 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:46:57,996 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:46:57,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:46:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1844705807, now seen corresponding path program 3 times [2025-04-13 22:46:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:46:57,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353323151] [2025-04-13 22:46:57,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:46:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:46:58,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:46:58,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:46:58,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:46:58,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:46:58,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353323151] [2025-04-13 22:46:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353323151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:46:58,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100970344] [2025-04-13 22:46:58,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:46:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:46:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:46:58,735 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:46:58,737 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:46:58,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:46:58,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:46:58,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:46:58,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:58,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:46:58,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:46:58,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:46:59,399 INFO L325 Elim1Store]: treesize reduction 99, result has 9.2 percent of original size [2025-04-13 22:46:59,399 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 70 treesize of output 29 [2025-04-13 22:46:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:59,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:00,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 22:47:00,171 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 22:47:00,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 520 treesize of output 426 [2025-04-13 22:47:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100970344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:02,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-04-13 22:47:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923145100] [2025-04-13 22:47:02,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:02,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 22:47:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:02,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 22:47:02,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:47:02,178 INFO L87 Difference]: Start difference. First operand 624 states and 1653 transitions. Second operand has 56 states, 55 states have (on average 1.490909090909091) internal successors, (82), 55 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:47:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:17,085 INFO L93 Difference]: Finished difference Result 2636 states and 6938 transitions. [2025-04-13 22:47:17,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2025-04-13 22:47:17,086 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.490909090909091) internal successors, (82), 55 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 30 [2025-04-13 22:47:17,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:17,092 INFO L225 Difference]: With dead ends: 2636 [2025-04-13 22:47:17,092 INFO L226 Difference]: Without dead ends: 1923 [2025-04-13 22:47:17,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31805 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=11771, Invalid=69169, Unknown=0, NotChecked=0, Total=80940 [2025-04-13 22:47:17,097 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1343 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3591 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 3591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:17,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 16 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 3591 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 22:47:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-04-13 22:47:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 823. [2025-04-13 22:47:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.708029197080292) internal successors, (2226), 822 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have 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:47:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 2226 transitions. [2025-04-13 22:47:17,115 INFO L79 Accepts]: Start accepts. Automaton has 823 states and 2226 transitions. Word has length 30 [2025-04-13 22:47:17,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:17,116 INFO L485 AbstractCegarLoop]: Abstraction has 823 states and 2226 transitions. [2025-04-13 22:47:17,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.490909090909091) internal successors, (82), 55 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:47:17,116 INFO L278 IsEmpty]: Start isEmpty. Operand 823 states and 2226 transitions. [2025-04-13 22:47:17,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:47:17,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:17,117 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:17,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:47:17,317 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:47:17,318 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:47:17,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1505734107, now seen corresponding path program 4 times [2025-04-13 22:47:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:17,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399620288] [2025-04-13 22:47:17,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:17,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:47:17,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:17,334 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:17,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399620288] [2025-04-13 22:47:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399620288] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:17,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259899223] [2025-04-13 22:47:17,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:17,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:17,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:17,953 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:47:17,954 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:47:18,007 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:47:18,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:18,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:18,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:18,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:47:18,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:18,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:47:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:18,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:19,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:47:19,105 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:19,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 530 treesize of output 434 [2025-04-13 22:47:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259899223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:21,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 53 [2025-04-13 22:47:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445951238] [2025-04-13 22:47:21,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:21,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 22:47:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:21,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 22:47:21,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2478, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:47:21,003 INFO L87 Difference]: Start difference. First operand 823 states and 2226 transitions. Second operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:47:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:25,246 INFO L93 Difference]: Finished difference Result 2062 states and 5262 transitions. [2025-04-13 22:47:25,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-04-13 22:47:25,246 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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 30 [2025-04-13 22:47:25,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:25,253 INFO L225 Difference]: With dead ends: 2062 [2025-04-13 22:47:25,253 INFO L226 Difference]: Without dead ends: 1664 [2025-04-13 22:47:25,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6311 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2909, Invalid=15451, Unknown=0, NotChecked=0, Total=18360 [2025-04-13 22:47:25,255 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 853 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:25,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 23 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:47:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-04-13 22:47:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 837. [2025-04-13 22:47:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 2.721291866028708) internal successors, (2275), 836 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have 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:47:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2275 transitions. [2025-04-13 22:47:25,271 INFO L79 Accepts]: Start accepts. Automaton has 837 states and 2275 transitions. Word has length 30 [2025-04-13 22:47:25,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:25,271 INFO L485 AbstractCegarLoop]: Abstraction has 837 states and 2275 transitions. [2025-04-13 22:47:25,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:47:25,271 INFO L278 IsEmpty]: Start isEmpty. Operand 837 states and 2275 transitions. [2025-04-13 22:47:25,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:47:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:25,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:25,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 22:47:25,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:47:25,473 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:47:25,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -34441751, now seen corresponding path program 5 times [2025-04-13 22:47:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:25,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554290585] [2025-04-13 22:47:25,474 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:47:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:25,478 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:47:25,487 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:25,487 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:47:25,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:26,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554290585] [2025-04-13 22:47:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554290585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:26,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769584192] [2025-04-13 22:47:26,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:47:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:26,072 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:47:26,073 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:47:26,119 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:47:26,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:26,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:47:26,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:26,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 22:47:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:26,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:47:26,722 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:47:26,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:26,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:26,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:26,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:26,725 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:47:26,728 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:26,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 26 [2025-04-13 22:47:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:26,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:27,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 22:47:27,485 INFO L325 Elim1Store]: treesize reduction 42, result has 61.5 percent of original size [2025-04-13 22:47:27,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 544 treesize of output 432 [2025-04-13 22:47:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769584192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:30,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:30,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 51 [2025-04-13 22:47:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815309874] [2025-04-13 22:47:30,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:30,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:47:30,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:30,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:47:30,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2323, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:47:30,385 INFO L87 Difference]: Start difference. First operand 837 states and 2275 transitions. Second operand has 53 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 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:47:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:43,108 INFO L93 Difference]: Finished difference Result 2825 states and 7189 transitions. [2025-04-13 22:47:43,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2025-04-13 22:47:43,109 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 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 30 [2025-04-13 22:47:43,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:43,122 INFO L225 Difference]: With dead ends: 2825 [2025-04-13 22:47:43,123 INFO L226 Difference]: Without dead ends: 2493 [2025-04-13 22:47:43,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19657 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=7981, Invalid=41971, Unknown=0, NotChecked=0, Total=49952 [2025-04-13 22:47:43,128 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1872 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:43,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 20 Invalid, 3863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 22:47:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-04-13 22:47:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1105. [2025-04-13 22:47:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 2.7509057971014492) internal successors, (3037), 1104 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have 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:47:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 3037 transitions. [2025-04-13 22:47:43,153 INFO L79 Accepts]: Start accepts. Automaton has 1105 states and 3037 transitions. Word has length 30 [2025-04-13 22:47:43,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:43,153 INFO L485 AbstractCegarLoop]: Abstraction has 1105 states and 3037 transitions. [2025-04-13 22:47:43,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 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:47:43,153 INFO L278 IsEmpty]: Start isEmpty. Operand 1105 states and 3037 transitions. [2025-04-13 22:47:43,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:47:43,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:43,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:43,162 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:47:43,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:43,359 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:47:43,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2059826815, now seen corresponding path program 6 times [2025-04-13 22:47:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:43,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952180602] [2025-04-13 22:47:43,360 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:47:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:43,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:47:43,376 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:43,376 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:47:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:43,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952180602] [2025-04-13 22:47:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952180602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:43,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693823147] [2025-04-13 22:47:43,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:47:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:43,998 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:47:43,998 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:47:44,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:47:44,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:44,060 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:47:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:44,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 22:47:44,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:44,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:47:44,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:44,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:47:44,557 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:47:44,559 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:44,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2025-04-13 22:47:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:44,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:45,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 152 [2025-04-13 22:47:45,254 INFO L325 Elim1Store]: treesize reduction 36, result has 65.0 percent of original size [2025-04-13 22:47:45,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 525 treesize of output 412 [2025-04-13 22:47:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693823147] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:47,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 53 [2025-04-13 22:47:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493724056] [2025-04-13 22:47:47,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:47,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 22:47:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:47,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 22:47:47,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2530, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:47:47,555 INFO L87 Difference]: Start difference. First operand 1105 states and 3037 transitions. Second operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:47:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:53,550 INFO L93 Difference]: Finished difference Result 2164 states and 5689 transitions. [2025-04-13 22:47:53,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 22:47:53,551 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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 30 [2025-04-13 22:47:53,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:53,557 INFO L225 Difference]: With dead ends: 2164 [2025-04-13 22:47:53,557 INFO L226 Difference]: Without dead ends: 1792 [2025-04-13 22:47:53,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7237 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3215, Invalid=16525, Unknown=0, NotChecked=0, Total=19740 [2025-04-13 22:47:53,560 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 915 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:53,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 15 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:47:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-04-13 22:47:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1083. [2025-04-13 22:47:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 2.744916820702403) internal successors, (2970), 1082 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have 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:47:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2970 transitions. [2025-04-13 22:47:53,579 INFO L79 Accepts]: Start accepts. Automaton has 1083 states and 2970 transitions. Word has length 30 [2025-04-13 22:47:53,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:53,580 INFO L485 AbstractCegarLoop]: Abstraction has 1083 states and 2970 transitions. [2025-04-13 22:47:53,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:47:53,580 INFO L278 IsEmpty]: Start isEmpty. Operand 1083 states and 2970 transitions. [2025-04-13 22:47:53,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:47:53,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:53,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:53,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:47:53,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-13 22:47:53,782 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:47:53,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 20644781, now seen corresponding path program 7 times [2025-04-13 22:47:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:53,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82527569] [2025-04-13 22:47:53,783 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:47:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:53,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:47:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:53,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:47:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:54,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82527569] [2025-04-13 22:47:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82527569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:54,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252649713] [2025-04-13 22:47:54,536 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:47:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:54,537 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:47:54,539 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:47:54,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:47:54,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:54,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:47:54,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:54,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:47:54,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:55,217 INFO L325 Elim1Store]: treesize reduction 99, result has 9.2 percent of original size [2025-04-13 22:47:55,217 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 70 treesize of output 29 [2025-04-13 22:47:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:55,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:55,739 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 22:47:55,739 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 106 treesize of output 114 [2025-04-13 22:47:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252649713] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:56,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2025-04-13 22:47:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985491643] [2025-04-13 22:47:56,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:56,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:47:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:56,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:47:56,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:47:56,316 INFO L87 Difference]: Start difference. First operand 1083 states and 2970 transitions. Second operand has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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:48:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:04,268 INFO L93 Difference]: Finished difference Result 1815 states and 4769 transitions. [2025-04-13 22:48:04,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 22:48:04,269 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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 30 [2025-04-13 22:48:04,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:04,273 INFO L225 Difference]: With dead ends: 1815 [2025-04-13 22:48:04,273 INFO L226 Difference]: Without dead ends: 1367 [2025-04-13 22:48:04,275 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7015 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3134, Invalid=17172, Unknown=0, NotChecked=0, Total=20306 [2025-04-13 22:48:04,275 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 561 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:04,275 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 20 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:48:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-04-13 22:48:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 867. [2025-04-13 22:48:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 2.6882217090069283) internal successors, (2328), 866 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have 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:48:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2328 transitions. [2025-04-13 22:48:04,290 INFO L79 Accepts]: Start accepts. Automaton has 867 states and 2328 transitions. Word has length 30 [2025-04-13 22:48:04,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:04,290 INFO L485 AbstractCegarLoop]: Abstraction has 867 states and 2328 transitions. [2025-04-13 22:48:04,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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:48:04,290 INFO L278 IsEmpty]: Start isEmpty. Operand 867 states and 2328 transitions. [2025-04-13 22:48:04,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:04,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:04,293 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:04,299 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:48:04,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:04,494 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:04,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash -754216635, now seen corresponding path program 8 times [2025-04-13 22:48:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:04,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108877225] [2025-04-13 22:48:04,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:48:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:04,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:48:04,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:04,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:48:04,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:05,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108877225] [2025-04-13 22:48:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108877225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:05,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283435035] [2025-04-13 22:48:05,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:48:05,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:05,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:05,022 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:48:05,023 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:48:05,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:48:05,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:05,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:48:05,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:05,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:48:05,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:05,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:48:05,670 INFO L325 Elim1Store]: treesize reduction 99, result has 9.2 percent of original size [2025-04-13 22:48:05,670 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 70 treesize of output 29 [2025-04-13 22:48:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:05,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:06,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 22:48:06,371 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 22:48:06,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 536 treesize of output 442 [2025-04-13 22:48:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283435035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:09,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:09,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 52 [2025-04-13 22:48:09,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775478800] [2025-04-13 22:48:09,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:09,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:48:09,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:09,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:48:09,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:48:09,060 INFO L87 Difference]: Start difference. First operand 867 states and 2328 transitions. Second operand has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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:48:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:17,925 INFO L93 Difference]: Finished difference Result 1399 states and 3522 transitions. [2025-04-13 22:48:17,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-04-13 22:48:17,926 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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 30 [2025-04-13 22:48:17,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:17,930 INFO L225 Difference]: With dead ends: 1399 [2025-04-13 22:48:17,930 INFO L226 Difference]: Without dead ends: 1350 [2025-04-13 22:48:17,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9713 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3604, Invalid=23456, Unknown=0, NotChecked=0, Total=27060 [2025-04-13 22:48:17,932 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 763 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:17,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 25 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:48:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-04-13 22:48:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 865. [2025-04-13 22:48:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 2.6840277777777777) internal successors, (2319), 864 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have 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:48:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2319 transitions. [2025-04-13 22:48:17,946 INFO L79 Accepts]: Start accepts. Automaton has 865 states and 2319 transitions. Word has length 30 [2025-04-13 22:48:17,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:17,946 INFO L485 AbstractCegarLoop]: Abstraction has 865 states and 2319 transitions. [2025-04-13 22:48:17,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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:48:17,947 INFO L278 IsEmpty]: Start isEmpty. Operand 865 states and 2319 transitions. [2025-04-13 22:48:17,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:17,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:17,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:17,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 22:48:18,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:18,148 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:18,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 726538209, now seen corresponding path program 9 times [2025-04-13 22:48:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:18,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879887753] [2025-04-13 22:48:18,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:48:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:18,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:18,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-04-13 22:48:18,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:48:18,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:18,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879887753] [2025-04-13 22:48:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879887753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:18,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804776674] [2025-04-13 22:48:18,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:48:18,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:18,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:18,418 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:48:18,419 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:48:18,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:18,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-04-13 22:48:18,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:48:18,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:18,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:48:18,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:18,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:18,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:18,912 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 108 treesize of output 114 [2025-04-13 22:48:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804776674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:19,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2025-04-13 22:48:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815636478] [2025-04-13 22:48:19,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:19,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:48:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:19,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:48:19,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:48:19,021 INFO L87 Difference]: Start difference. First operand 865 states and 2319 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:48:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:22,034 INFO L93 Difference]: Finished difference Result 2746 states and 7254 transitions. [2025-04-13 22:48:22,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-13 22:48:22,035 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 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 30 [2025-04-13 22:48:22,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:22,041 INFO L225 Difference]: With dead ends: 2746 [2025-04-13 22:48:22,041 INFO L226 Difference]: Without dead ends: 2533 [2025-04-13 22:48:22,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1788, Invalid=12974, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 22:48:22,043 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 427 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:22,043 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 15 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:48:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-04-13 22:48:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 873. [2025-04-13 22:48:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 2.680045871559633) internal successors, (2337), 872 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have 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:48:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2337 transitions. [2025-04-13 22:48:22,061 INFO L79 Accepts]: Start accepts. Automaton has 873 states and 2337 transitions. Word has length 30 [2025-04-13 22:48:22,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:22,061 INFO L485 AbstractCegarLoop]: Abstraction has 873 states and 2337 transitions. [2025-04-13 22:48:22,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:48:22,061 INFO L278 IsEmpty]: Start isEmpty. Operand 873 states and 2337 transitions. [2025-04-13 22:48:22,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:22,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:22,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:22,069 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:48:22,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 22:48:22,263 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:22,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1298846855, now seen corresponding path program 10 times [2025-04-13 22:48:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:22,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420038770] [2025-04-13 22:48:22,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:48:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:22,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:48:22,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:22,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:48:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:22,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420038770] [2025-04-13 22:48:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420038770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:22,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880173158] [2025-04-13 22:48:22,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:48:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:22,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:22,771 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:48:22,772 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:48:22,817 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:48:22,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:22,834 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:48:22,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:22,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:48:22,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:22,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:48:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:23,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:23,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:48:23,861 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:23,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 546 treesize of output 450 [2025-04-13 22:48:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880173158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:26,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:26,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 53 [2025-04-13 22:48:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86557679] [2025-04-13 22:48:26,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:26,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 22:48:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:26,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 22:48:26,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=2509, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:48:26,721 INFO L87 Difference]: Start difference. First operand 873 states and 2337 transitions. Second operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:48:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:30,363 INFO L93 Difference]: Finished difference Result 1736 states and 4521 transitions. [2025-04-13 22:48:30,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 22:48:30,363 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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 30 [2025-04-13 22:48:30,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:30,367 INFO L225 Difference]: With dead ends: 1736 [2025-04-13 22:48:30,367 INFO L226 Difference]: Without dead ends: 1653 [2025-04-13 22:48:30,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4958 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2179, Invalid=12583, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 22:48:30,369 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 628 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:30,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 24 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:48:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2025-04-13 22:48:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 873. [2025-04-13 22:48:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 2.686926605504587) internal successors, (2343), 872 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have 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:48:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2343 transitions. [2025-04-13 22:48:30,384 INFO L79 Accepts]: Start accepts. Automaton has 873 states and 2343 transitions. Word has length 30 [2025-04-13 22:48:30,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:30,384 INFO L485 AbstractCegarLoop]: Abstraction has 873 states and 2343 transitions. [2025-04-13 22:48:30,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 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:48:30,384 INFO L278 IsEmpty]: Start isEmpty. Operand 873 states and 2343 transitions. [2025-04-13 22:48:30,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:30,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:30,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:30,392 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:48:30,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:30,586 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:30,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash 781624741, now seen corresponding path program 11 times [2025-04-13 22:48:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:30,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737139000] [2025-04-13 22:48:30,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:48:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:30,591 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:30,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:30,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:48:30,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:31,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737139000] [2025-04-13 22:48:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737139000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:31,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021933570] [2025-04-13 22:48:31,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:48:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:31,262 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:48:31,262 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:48:31,310 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:31,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:31,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:48:31,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:31,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:48:31,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:48:31,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:31,983 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:31,983 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 108 treesize of output 114 [2025-04-13 22:48:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021933570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:32,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:32,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 13] total 44 [2025-04-13 22:48:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670966288] [2025-04-13 22:48:32,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:32,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:48:32,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:32,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:48:32,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:48:32,096 INFO L87 Difference]: Start difference. First operand 873 states and 2343 transitions. Second operand has 46 states, 45 states have (on average 1.7777777777777777) 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:48:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:39,316 INFO L93 Difference]: Finished difference Result 3224 states and 8355 transitions. [2025-04-13 22:48:39,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2025-04-13 22:48:39,316 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7777777777777777) 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 30 [2025-04-13 22:48:39,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:39,327 INFO L225 Difference]: With dead ends: 3224 [2025-04-13 22:48:39,327 INFO L226 Difference]: Without dead ends: 3002 [2025-04-13 22:48:39,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16765 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3333, Invalid=39723, Unknown=0, NotChecked=0, Total=43056 [2025-04-13 22:48:39,331 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 754 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5117 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 5117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:39,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 21 Invalid, 5282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 5117 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 22:48:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2025-04-13 22:48:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 917. [2025-04-13 22:48:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 916 states have (on average 2.688864628820961) internal successors, (2463), 916 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have 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:48:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 2463 transitions. [2025-04-13 22:48:39,357 INFO L79 Accepts]: Start accepts. Automaton has 917 states and 2463 transitions. Word has length 30 [2025-04-13 22:48:39,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:39,357 INFO L485 AbstractCegarLoop]: Abstraction has 917 states and 2463 transitions. [2025-04-13 22:48:39,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7777777777777777) 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:48:39,357 INFO L278 IsEmpty]: Start isEmpty. Operand 917 states and 2463 transitions. [2025-04-13 22:48:39,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:39,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:39,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:39,365 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:48:39,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:39,559 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:39,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -758551117, now seen corresponding path program 12 times [2025-04-13 22:48:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:39,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360740129] [2025-04-13 22:48:39,559 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:48:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:39,565 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:39,573 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:39,573 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:48:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:39,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360740129] [2025-04-13 22:48:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360740129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:39,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713752459] [2025-04-13 22:48:39,844 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:48:39,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:39,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:39,846 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:48:39,847 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:48:39,904 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:48:39,925 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:39,926 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:48:39,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:39,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:48:39,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:39,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:48:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:40,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:40,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:48:40,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:40,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 554 treesize of output 458 [2025-04-13 22:48:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713752459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:43,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2025-04-13 22:48:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048591217] [2025-04-13 22:48:43,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:43,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 22:48:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:43,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 22:48:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1868, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:48:43,684 INFO L87 Difference]: Start difference. First operand 917 states and 2463 transitions. Second operand has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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:48:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:53,773 INFO L93 Difference]: Finished difference Result 3154 states and 8280 transitions. [2025-04-13 22:48:53,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-04-13 22:48:53,773 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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 30 [2025-04-13 22:48:53,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:53,779 INFO L225 Difference]: With dead ends: 3154 [2025-04-13 22:48:53,779 INFO L226 Difference]: Without dead ends: 2871 [2025-04-13 22:48:53,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19848 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=5615, Invalid=42127, Unknown=0, NotChecked=0, Total=47742 [2025-04-13 22:48:53,783 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 847 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:53,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 18 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:48:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2025-04-13 22:48:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 965. [2025-04-13 22:48:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 2.675311203319502) internal successors, (2579), 964 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have 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:48:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2579 transitions. [2025-04-13 22:48:53,804 INFO L79 Accepts]: Start accepts. Automaton has 965 states and 2579 transitions. Word has length 30 [2025-04-13 22:48:53,805 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:53,805 INFO L485 AbstractCegarLoop]: Abstraction has 965 states and 2579 transitions. [2025-04-13 22:48:53,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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:48:53,805 INFO L278 IsEmpty]: Start isEmpty. Operand 965 states and 2579 transitions. [2025-04-13 22:48:53,806 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:48:53,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:53,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:53,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 22:48:54,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:54,010 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:48:54,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1511031115, now seen corresponding path program 13 times [2025-04-13 22:48:54,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:54,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983332109] [2025-04-13 22:48:54,010 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:48:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:54,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:48:54,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:54,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:48:54,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:54,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983332109] [2025-04-13 22:48:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983332109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:54,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330466025] [2025-04-13 22:48:54,618 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:48:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:54,619 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:48:54,620 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:48:54,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:48:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:48:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:48:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:54,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:48:54,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:48:55,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:55,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:55,326 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 108 treesize of output 114 [2025-04-13 22:48:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330466025] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:55,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 44 [2025-04-13 22:48:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438811165] [2025-04-13 22:48:55,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:55,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:48:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:48:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:48:55,438 INFO L87 Difference]: Start difference. First operand 965 states and 2579 transitions. Second operand has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:49:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:00,108 INFO L93 Difference]: Finished difference Result 2544 states and 6707 transitions. [2025-04-13 22:49:00,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-04-13 22:49:00,109 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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 30 [2025-04-13 22:49:00,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:00,113 INFO L225 Difference]: With dead ends: 2544 [2025-04-13 22:49:00,113 INFO L226 Difference]: Without dead ends: 2158 [2025-04-13 22:49:00,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8086 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2342, Invalid=20914, Unknown=0, NotChecked=0, Total=23256 [2025-04-13 22:49:00,116 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 645 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:00,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 22 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:49:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-04-13 22:49:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 887. [2025-04-13 22:49:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 2.6975169300225734) internal successors, (2390), 886 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have 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:49:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2390 transitions. [2025-04-13 22:49:00,135 INFO L79 Accepts]: Start accepts. Automaton has 887 states and 2390 transitions. Word has length 30 [2025-04-13 22:49:00,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:00,135 INFO L485 AbstractCegarLoop]: Abstraction has 887 states and 2390 transitions. [2025-04-13 22:49:00,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:49:00,135 INFO L278 IsEmpty]: Start isEmpty. Operand 887 states and 2390 transitions. [2025-04-13 22:49:00,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:00,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:00,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:00,143 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:49:00,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:49:00,337 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:00,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -703464585, now seen corresponding path program 14 times [2025-04-13 22:49:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:00,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318971781] [2025-04-13 22:49:00,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:49:00,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:00,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:00,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:00,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:49:00,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:00,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318971781] [2025-04-13 22:49:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318971781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:00,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642505876] [2025-04-13 22:49:00,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:49:00,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:00,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:00,844 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:49:00,844 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:49:00,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:00,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:00,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:49:00,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:00,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:49:00,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:00,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:49:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:01,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:01,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:49:01,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:01,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 546 treesize of output 450 [2025-04-13 22:49:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642505876] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:03,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2025-04-13 22:49:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913974431] [2025-04-13 22:49:03,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:03,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 22:49:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 22:49:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2228, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:49:03,803 INFO L87 Difference]: Start difference. First operand 887 states and 2390 transitions. Second operand has 52 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 51 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:49:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:08,395 INFO L93 Difference]: Finished difference Result 1733 states and 4555 transitions. [2025-04-13 22:49:08,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-04-13 22:49:08,395 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 51 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 30 [2025-04-13 22:49:08,395 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:08,398 INFO L225 Difference]: With dead ends: 1733 [2025-04-13 22:49:08,398 INFO L226 Difference]: Without dead ends: 1651 [2025-04-13 22:49:08,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6759 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2424, Invalid=15132, Unknown=0, NotChecked=0, Total=17556 [2025-04-13 22:49:08,400 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 438 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:08,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 20 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:49:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-04-13 22:49:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 889. [2025-04-13 22:49:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 2.6970720720720722) internal successors, (2395), 888 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have 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:49:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2395 transitions. [2025-04-13 22:49:08,414 INFO L79 Accepts]: Start accepts. Automaton has 889 states and 2395 transitions. Word has length 30 [2025-04-13 22:49:08,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:08,414 INFO L485 AbstractCegarLoop]: Abstraction has 889 states and 2395 transitions. [2025-04-13 22:49:08,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 51 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:49:08,414 INFO L278 IsEmpty]: Start isEmpty. Operand 889 states and 2395 transitions. [2025-04-13 22:49:08,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:08,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:08,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:08,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 22:49:08,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:49:08,616 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:08,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1478326001, now seen corresponding path program 15 times [2025-04-13 22:49:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:08,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968730965] [2025-04-13 22:49:08,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:49:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:08,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:08,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-04-13 22:49:08,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:49:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:49:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:08,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968730965] [2025-04-13 22:49:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968730965] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:08,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114730239] [2025-04-13 22:49:08,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:49:08,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:08,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:08,921 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:49:08,922 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:49:08,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:08,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-04-13 22:49:08,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:49:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:09,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:49:09,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:49:09,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:09,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:09,427 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 108 treesize of output 114 [2025-04-13 22:49:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:49:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114730239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2025-04-13 22:49:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776286836] [2025-04-13 22:49:09,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:09,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:49:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:09,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:49:09,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:49:09,537 INFO L87 Difference]: Start difference. First operand 889 states and 2395 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:49:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:11,405 INFO L93 Difference]: Finished difference Result 2141 states and 5722 transitions. [2025-04-13 22:49:11,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:49:11,406 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 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 30 [2025-04-13 22:49:11,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:11,410 INFO L225 Difference]: With dead ends: 2141 [2025-04-13 22:49:11,410 INFO L226 Difference]: Without dead ends: 2063 [2025-04-13 22:49:11,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=830, Invalid=5176, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:49:11,411 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 287 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:11,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 21 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:49:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-04-13 22:49:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 901. [2025-04-13 22:49:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 2.716666666666667) internal successors, (2445), 900 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have 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:49:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2445 transitions. [2025-04-13 22:49:11,426 INFO L79 Accepts]: Start accepts. Automaton has 901 states and 2445 transitions. Word has length 30 [2025-04-13 22:49:11,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:11,427 INFO L485 AbstractCegarLoop]: Abstraction has 901 states and 2445 transitions. [2025-04-13 22:49:11,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:49:11,427 INFO L278 IsEmpty]: Start isEmpty. Operand 901 states and 2445 transitions. [2025-04-13 22:49:11,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:11,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:11,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:11,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 22:49:11,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 22:49:11,628 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:11,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1833536829, now seen corresponding path program 16 times [2025-04-13 22:49:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:11,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135896167] [2025-04-13 22:49:11,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:49:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:11,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:11,641 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:11,641 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:49:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:12,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135896167] [2025-04-13 22:49:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135896167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:12,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487613317] [2025-04-13 22:49:12,194 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:49:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:12,196 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:49:12,197 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:49:12,248 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:12,265 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:12,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:49:12,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:12,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:49:12,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:12,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:49:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:12,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:13,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:49:13,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:13,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 546 treesize of output 450 [2025-04-13 22:49:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487613317] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:15,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2025-04-13 22:49:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368713670] [2025-04-13 22:49:15,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:15,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:49:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:15,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:49:15,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:49:15,410 INFO L87 Difference]: Start difference. First operand 901 states and 2445 transitions. Second operand has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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:49:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:20,251 INFO L93 Difference]: Finished difference Result 1875 states and 4907 transitions. [2025-04-13 22:49:20,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-04-13 22:49:20,251 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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 30 [2025-04-13 22:49:20,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:20,255 INFO L225 Difference]: With dead ends: 1875 [2025-04-13 22:49:20,255 INFO L226 Difference]: Without dead ends: 1682 [2025-04-13 22:49:20,256 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7825 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2536, Invalid=18344, Unknown=0, NotChecked=0, Total=20880 [2025-04-13 22:49:20,257 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 599 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:20,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 18 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:49:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-04-13 22:49:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 915. [2025-04-13 22:49:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 2.713347921225383) internal successors, (2480), 914 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have 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:49:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2480 transitions. [2025-04-13 22:49:20,271 INFO L79 Accepts]: Start accepts. Automaton has 915 states and 2480 transitions. Word has length 30 [2025-04-13 22:49:20,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:20,271 INFO L485 AbstractCegarLoop]: Abstraction has 915 states and 2480 transitions. [2025-04-13 22:49:20,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 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:49:20,271 INFO L278 IsEmpty]: Start isEmpty. Operand 915 states and 2480 transitions. [2025-04-13 22:49:20,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:20,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:20,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:20,278 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:49:20,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:20,473 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:20,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash 436045403, now seen corresponding path program 17 times [2025-04-13 22:49:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:20,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833148881] [2025-04-13 22:49:20,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:49:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:20,486 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:20,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:20,494 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:49:20,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:21,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833148881] [2025-04-13 22:49:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833148881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:21,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564111560] [2025-04-13 22:49:21,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:49:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:21,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:21,039 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:49:21,039 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:49:21,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:21,109 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:21,110 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:49:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:21,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:49:21,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:21,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:49:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:21,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:22,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 22:49:22,139 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:22,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 530 treesize of output 434 [2025-04-13 22:49:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564111560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:23,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 52 [2025-04-13 22:49:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068750817] [2025-04-13 22:49:23,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:23,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:49:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:23,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:49:23,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2457, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:49:23,762 INFO L87 Difference]: Start difference. First operand 915 states and 2480 transitions. Second operand has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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:49:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:31,052 INFO L93 Difference]: Finished difference Result 2202 states and 5621 transitions. [2025-04-13 22:49:31,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-04-13 22:49:31,052 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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 30 [2025-04-13 22:49:31,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:31,056 INFO L225 Difference]: With dead ends: 2202 [2025-04-13 22:49:31,056 INFO L226 Difference]: Without dead ends: 1834 [2025-04-13 22:49:31,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11723 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4625, Invalid=26527, Unknown=0, NotChecked=0, Total=31152 [2025-04-13 22:49:31,058 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1023 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3616 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 3616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:31,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 24 Invalid, 4094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 3616 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:49:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-04-13 22:49:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 919. [2025-04-13 22:49:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 2.6949891067538125) internal successors, (2474), 918 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have 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:49:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2474 transitions. [2025-04-13 22:49:31,071 INFO L79 Accepts]: Start accepts. Automaton has 919 states and 2474 transitions. Word has length 30 [2025-04-13 22:49:31,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:31,071 INFO L485 AbstractCegarLoop]: Abstraction has 919 states and 2474 transitions. [2025-04-13 22:49:31,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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:49:31,071 INFO L278 IsEmpty]: Start isEmpty. Operand 919 states and 2474 transitions. [2025-04-13 22:49:31,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:31,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:31,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:31,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 22:49:31,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:31,273 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:31,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1778450297, now seen corresponding path program 18 times [2025-04-13 22:49:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:31,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541308248] [2025-04-13 22:49:31,273 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:49:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:31,278 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:31,284 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:31,284 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:49:31,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:49:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:31,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541308248] [2025-04-13 22:49:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541308248] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:31,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091461536] [2025-04-13 22:49:31,559 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:49:31,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:31,561 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:49:31,562 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:49:31,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:49:31,637 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:31,637 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:49:31,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:31,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 22:49:31,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:31,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:49:32,123 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:49:32,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:49:32,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:49:32,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:49:32,125 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:49:32,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:32,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 26 [2025-04-13 22:49:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:32,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:32,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 22:49:32,804 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 22:49:32,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 536 treesize of output 442 [2025-04-13 22:49:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091461536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:37,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2025-04-13 22:49:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398609910] [2025-04-13 22:49:37,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:37,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 22:49:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 22:49:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1928, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:49:37,253 INFO L87 Difference]: Start difference. First operand 919 states and 2474 transitions. Second operand has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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:49:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:47,043 INFO L93 Difference]: Finished difference Result 3058 states and 8117 transitions. [2025-04-13 22:49:47,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2025-04-13 22:49:47,043 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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 30 [2025-04-13 22:49:47,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:47,048 INFO L225 Difference]: With dead ends: 3058 [2025-04-13 22:49:47,048 INFO L226 Difference]: Without dead ends: 2910 [2025-04-13 22:49:47,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17058 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=4927, Invalid=36079, Unknown=0, NotChecked=0, Total=41006 [2025-04-13 22:49:47,050 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 836 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:47,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 21 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:49:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-04-13 22:49:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 959. [2025-04-13 22:49:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 2.6868475991649268) internal successors, (2574), 958 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have 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:49:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2574 transitions. [2025-04-13 22:49:47,068 INFO L79 Accepts]: Start accepts. Automaton has 959 states and 2574 transitions. Word has length 30 [2025-04-13 22:49:47,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:47,069 INFO L485 AbstractCegarLoop]: Abstraction has 959 states and 2574 transitions. [2025-04-13 22:49:47,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 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:49:47,069 INFO L278 IsEmpty]: Start isEmpty. Operand 959 states and 2574 transitions. [2025-04-13 22:49:47,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:47,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:47,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:47,076 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:49:47,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 22:49:47,270 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:47,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1741655583, now seen corresponding path program 19 times [2025-04-13 22:49:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:47,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720858316] [2025-04-13 22:49:47,271 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:49:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:47,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:49:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:47,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:49:47,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:47,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720858316] [2025-04-13 22:49:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720858316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:47,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232600783] [2025-04-13 22:49:47,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:49:47,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:47,862 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:49:47,862 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:49:47,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:49:47,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:47,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:49:47,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:47,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:49:47,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:49:48,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:48,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:49:48,532 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 108 treesize of output 114 [2025-04-13 22:49:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:49:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232600783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:48,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 44 [2025-04-13 22:49:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446935318] [2025-04-13 22:49:48,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:48,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:49:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:48,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:49:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:49:48,646 INFO L87 Difference]: Start difference. First operand 959 states and 2574 transitions. Second operand has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:49:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:54,225 INFO L93 Difference]: Finished difference Result 3019 states and 8045 transitions. [2025-04-13 22:49:54,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 22:49:54,225 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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 30 [2025-04-13 22:49:54,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:54,230 INFO L225 Difference]: With dead ends: 3019 [2025-04-13 22:49:54,230 INFO L226 Difference]: Without dead ends: 2777 [2025-04-13 22:49:54,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9547 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2896, Invalid=23510, Unknown=0, NotChecked=0, Total=26406 [2025-04-13 22:49:54,233 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 833 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:54,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 26 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:49:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-04-13 22:49:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 989. [2025-04-13 22:49:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 2.6933198380566803) internal successors, (2661), 988 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have 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:49:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2661 transitions. [2025-04-13 22:49:54,251 INFO L79 Accepts]: Start accepts. Automaton has 989 states and 2661 transitions. Word has length 30 [2025-04-13 22:49:54,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:54,251 INFO L485 AbstractCegarLoop]: Abstraction has 989 states and 2661 transitions. [2025-04-13 22:49:54,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 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:49:54,251 INFO L278 IsEmpty]: Start isEmpty. Operand 989 states and 2661 transitions. [2025-04-13 22:49:54,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:49:54,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:54,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:54,259 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:49:54,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 22:49:54,453 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:49:54,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1016367451, now seen corresponding path program 20 times [2025-04-13 22:49:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:54,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744387324] [2025-04-13 22:49:54,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:49:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:54,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:54,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:54,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:49:54,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:54,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744387324] [2025-04-13 22:49:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744387324] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:54,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005722814] [2025-04-13 22:49:54,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:49:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:54,932 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:49:54,933 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:49:54,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:49:55,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:49:55,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:49:55,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:55,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:49:55,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:55,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:49:55,388 INFO L325 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2025-04-13 22:49:55,388 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 49 treesize of output 18 [2025-04-13 22:49:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:55,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:55,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 152 [2025-04-13 22:49:55,953 INFO L325 Elim1Store]: treesize reduction 23, result has 77.7 percent of original size [2025-04-13 22:49:55,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 541 treesize of output 441 [2025-04-13 22:49:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:49:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005722814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:49:58,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:49:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 49 [2025-04-13 22:49:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725965208] [2025-04-13 22:49:58,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:49:58,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 22:49:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:58,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 22:49:58,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2181, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:49:58,558 INFO L87 Difference]: Start difference. First operand 989 states and 2661 transitions. Second operand has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 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:50:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:02,637 INFO L93 Difference]: Finished difference Result 1603 states and 4100 transitions. [2025-04-13 22:50:02,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-04-13 22:50:02,637 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 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 30 [2025-04-13 22:50:02,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:02,640 INFO L225 Difference]: With dead ends: 1603 [2025-04-13 22:50:02,640 INFO L226 Difference]: Without dead ends: 1490 [2025-04-13 22:50:02,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6728 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2541, Invalid=15819, Unknown=0, NotChecked=0, Total=18360 [2025-04-13 22:50:02,642 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 598 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:02,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 19 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:50:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-04-13 22:50:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 939. [2025-04-13 22:50:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 2.6844349680170576) internal successors, (2518), 938 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have 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:50:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 2518 transitions. [2025-04-13 22:50:02,654 INFO L79 Accepts]: Start accepts. Automaton has 939 states and 2518 transitions. Word has length 30 [2025-04-13 22:50:02,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:02,654 INFO L485 AbstractCegarLoop]: Abstraction has 939 states and 2518 transitions. [2025-04-13 22:50:02,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 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:50:02,654 INFO L278 IsEmpty]: Start isEmpty. Operand 939 states and 2518 transitions. [2025-04-13 22:50:02,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:50:02,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:02,655 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:02,662 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:50:02,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:02,856 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:50:02,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1336016032, now seen corresponding path program 21 times [2025-04-13 22:50:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:02,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472707920] [2025-04-13 22:50:02,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:50:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:02,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-13 22:50:02,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:50:02,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:50:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:50:03,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:03,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472707920] [2025-04-13 22:50:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472707920] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:03,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093727425] [2025-04-13 22:50:03,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:50:03,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:03,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:03,133 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:50:03,135 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:50:03,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-13 22:50:03,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:50:03,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:50:03,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:03,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:50:03,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:50:03,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:03,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:50:03,717 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 108 treesize of output 114 [2025-04-13 22:50:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:50:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093727425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:03,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 39 [2025-04-13 22:50:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841584501] [2025-04-13 22:50:03,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:03,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:50:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:50:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:50:03,824 INFO L87 Difference]: Start difference. First operand 939 states and 2518 transitions. Second operand has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 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:50:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:11,477 INFO L93 Difference]: Finished difference Result 4257 states and 11223 transitions. [2025-04-13 22:50:11,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2025-04-13 22:50:11,477 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 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 31 [2025-04-13 22:50:11,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:11,484 INFO L225 Difference]: With dead ends: 4257 [2025-04-13 22:50:11,484 INFO L226 Difference]: Without dead ends: 4162 [2025-04-13 22:50:11,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28353 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7375, Invalid=57905, Unknown=0, NotChecked=0, Total=65280 [2025-04-13 22:50:11,488 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 906 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:11,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 16 Invalid, 3419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:50:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-04-13 22:50:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 945. [2025-04-13 22:50:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.6875) internal successors, (2537), 944 states have internal predecessors, (2537), 0 states have call successors, (0), 0 states have 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:50:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2537 transitions. [2025-04-13 22:50:11,512 INFO L79 Accepts]: Start accepts. Automaton has 945 states and 2537 transitions. Word has length 31 [2025-04-13 22:50:11,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:11,512 INFO L485 AbstractCegarLoop]: Abstraction has 945 states and 2537 transitions. [2025-04-13 22:50:11,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 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:50:11,513 INFO L278 IsEmpty]: Start isEmpty. Operand 945 states and 2537 transitions. [2025-04-13 22:50:11,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:50:11,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:11,514 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:11,520 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:50:11,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:11,714 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:50:11,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1525057226, now seen corresponding path program 22 times [2025-04-13 22:50:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:11,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517827694] [2025-04-13 22:50:11,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:50:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:11,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:50:11,730 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:50:11,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:50:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:50:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:11,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517827694] [2025-04-13 22:50:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517827694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:11,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999101775] [2025-04-13 22:50:11,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:50:11,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:11,979 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:50:11,979 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:50:12,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:50:12,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:50:12,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:50:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:12,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:50:12,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:50:12,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:12,563 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:50:12,563 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 108 treesize of output 114 [2025-04-13 22:50:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:50:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999101775] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:12,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 13] total 38 [2025-04-13 22:50:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571498947] [2025-04-13 22:50:12,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:12,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:50:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:12,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:50:12,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:50:12,668 INFO L87 Difference]: Start difference. First operand 945 states and 2537 transitions. Second operand has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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:50:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:14,855 INFO L93 Difference]: Finished difference Result 2617 states and 6962 transitions. [2025-04-13 22:50:14,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 22:50:14,855 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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 31 [2025-04-13 22:50:14,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:14,860 INFO L225 Difference]: With dead ends: 2617 [2025-04-13 22:50:14,860 INFO L226 Difference]: Without dead ends: 2513 [2025-04-13 22:50:14,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=981, Invalid=7949, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 22:50:14,862 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 432 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:14,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 21 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:50:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-04-13 22:50:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 919. [2025-04-13 22:50:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 2.6710239651416123) internal successors, (2452), 918 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have 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:50:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2452 transitions. [2025-04-13 22:50:14,878 INFO L79 Accepts]: Start accepts. Automaton has 919 states and 2452 transitions. Word has length 31 [2025-04-13 22:50:14,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:14,878 INFO L485 AbstractCegarLoop]: Abstraction has 919 states and 2452 transitions. [2025-04-13 22:50:14,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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:50:14,878 INFO L278 IsEmpty]: Start isEmpty. Operand 919 states and 2452 transitions. [2025-04-13 22:50:14,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:50:14,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:14,879 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:14,885 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:50:15,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:15,079 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:50:15,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash 92201203, now seen corresponding path program 23 times [2025-04-13 22:50:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:15,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341637181] [2025-04-13 22:50:15,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:50:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:15,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 22:50:15,088 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:50:15,088 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:50:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:50:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:15,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341637181] [2025-04-13 22:50:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341637181] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:15,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182290738] [2025-04-13 22:50:15,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:50:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:15,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:15,173 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:50:15,174 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:50:15,231 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 22:50:15,247 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:50:15,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:50:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:15,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:50:15,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:50:15,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:50:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182290738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:15,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 22:50:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256875917] [2025-04-13 22:50:15,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:15,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:50:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:15,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:50:15,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:50:15,436 INFO L87 Difference]: Start difference. First operand 919 states and 2452 transitions. Second operand has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:50:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:15,671 INFO L93 Difference]: Finished difference Result 1012 states and 2642 transitions. [2025-04-13 22:50:15,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:50:15,671 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 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 32 [2025-04-13 22:50:15,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:15,674 INFO L225 Difference]: With dead ends: 1012 [2025-04-13 22:50:15,674 INFO L226 Difference]: Without dead ends: 586 [2025-04-13 22:50:15,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:50:15,675 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:15,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 10 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:50:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-04-13 22:50:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-04-13 22:50:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 2.694017094017094) internal successors, (1576), 585 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1576 transitions. [2025-04-13 22:50:15,682 INFO L79 Accepts]: Start accepts. Automaton has 586 states and 1576 transitions. Word has length 32 [2025-04-13 22:50:15,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:15,682 INFO L485 AbstractCegarLoop]: Abstraction has 586 states and 1576 transitions. [2025-04-13 22:50:15,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:50:15,682 INFO L278 IsEmpty]: Start isEmpty. Operand 586 states and 1576 transitions. [2025-04-13 22:50:15,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:50:15,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:15,683 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:15,689 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:50:15,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 22:50:15,883 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:50:15,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash 867599172, now seen corresponding path program 24 times [2025-04-13 22:50:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:15,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908476104] [2025-04-13 22:50:15,884 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:50:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:15,889 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:50:15,894 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:50:15,894 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:50:15,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:50:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:15,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908476104] [2025-04-13 22:50:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908476104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:15,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920559371] [2025-04-13 22:50:15,941 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:50:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:15,944 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:50:15,945 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:50:16,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:50:16,034 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:50:16,034 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:50:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:16,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:50:16,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:50:16,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:50:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920559371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:16,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-13 22:50:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234228045] [2025-04-13 22:50:16,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:16,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:50:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:16,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:50:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:50:16,091 INFO L87 Difference]: Start difference. First operand 586 states and 1576 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:16,147 INFO L93 Difference]: Finished difference Result 1037 states and 2787 transitions. [2025-04-13 22:50:16,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:50:16,148 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:50:16,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:16,150 INFO L225 Difference]: With dead ends: 1037 [2025-04-13 22:50:16,150 INFO L226 Difference]: Without dead ends: 956 [2025-04-13 22:50:16,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:50:16,151 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:16,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:50:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-04-13 22:50:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 750. [2025-04-13 22:50:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.739652870493992) internal successors, (2052), 749 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have 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:50:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2052 transitions. [2025-04-13 22:50:16,160 INFO L79 Accepts]: Start accepts. Automaton has 750 states and 2052 transitions. Word has length 33 [2025-04-13 22:50:16,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:16,160 INFO L485 AbstractCegarLoop]: Abstraction has 750 states and 2052 transitions. [2025-04-13 22:50:16,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:16,160 INFO L278 IsEmpty]: Start isEmpty. Operand 750 states and 2052 transitions. [2025-04-13 22:50:16,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:50:16,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:16,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:16,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 22:50:16,362 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,SelfDestructingSolverStorable37 [2025-04-13 22:50:16,362 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:50:16,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 314248824, now seen corresponding path program 1 times [2025-04-13 22:50:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:16,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882125757] [2025-04-13 22:50:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:50:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:50:16,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:50:16,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:50:16,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:50:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:17,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882125757] [2025-04-13 22:50:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882125757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:17,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662183747] [2025-04-13 22:50:17,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:50:17,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:17,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:17,438 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:50:17,439 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:50:17,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:50:17,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:50:17,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:50:17,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:17,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 22:50:17,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:18,350 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:50:18,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:50:18,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:50:18,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:50:18,353 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:50:18,355 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:50:18,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 29 [2025-04-13 22:50:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:50:18,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:19,361 INFO L325 Elim1Store]: treesize reduction 44, result has 77.7 percent of original size [2025-04-13 22:50:19,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 190 [2025-04-13 22:50:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:50:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662183747] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:20,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 66 [2025-04-13 22:50:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913880661] [2025-04-13 22:50:20,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:20,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 22:50:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:20,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 22:50:20,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=3991, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 22:50:20,512 INFO L87 Difference]: Start difference. First operand 750 states and 2052 transitions. Second operand has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 67 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:56:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:04,467 INFO L93 Difference]: Finished difference Result 20649 states and 57108 transitions. [2025-04-13 22:56:04,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1367 states. [2025-04-13 22:56:04,468 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 67 states have internal predecessors, (97), 0 states have call successors, (0), 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 35 [2025-04-13 22:56:04,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:04,503 INFO L225 Difference]: With dead ends: 20649 [2025-04-13 22:56:04,503 INFO L226 Difference]: Without dead ends: 19254 [2025-04-13 22:56:04,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961368 ImplicationChecksByTransitivity, 324.0s TimeCoverageRelationStatistics Valid=144476, Invalid=1850680, Unknown=0, NotChecked=0, Total=1995156 [2025-04-13 22:56:04,611 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 3270 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18990 mSolverCounterSat, 1855 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1855 IncrementalHoareTripleChecker+Valid, 18990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:04,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 31 Invalid, 20845 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1855 Valid, 18990 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2025-04-13 22:56:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19254 states. [2025-04-13 22:56:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19254 to 4750. [2025-04-13 22:56:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4750 states, 4749 states have (on average 2.91282375236892) internal successors, (13833), 4749 states have internal predecessors, (13833), 0 states have call successors, (0), 0 states have 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:56:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 13833 transitions. [2025-04-13 22:56:04,778 INFO L79 Accepts]: Start accepts. Automaton has 4750 states and 13833 transitions. Word has length 35 [2025-04-13 22:56:04,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:04,779 INFO L485 AbstractCegarLoop]: Abstraction has 4750 states and 13833 transitions. [2025-04-13 22:56:04,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 67 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:56:04,779 INFO L278 IsEmpty]: Start isEmpty. Operand 4750 states and 13833 transitions. [2025-04-13 22:56:04,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:04,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:04,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:04,789 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:56:04,987 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,SelfDestructingSolverStorable38 [2025-04-13 22:56:04,987 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:56:04,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash 150967446, now seen corresponding path program 2 times [2025-04-13 22:56:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:04,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837993010] [2025-04-13 22:56:04,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:04,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:05,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:05,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:05,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837993010] [2025-04-13 22:56:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837993010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:05,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178342895] [2025-04-13 22:56:05,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:05,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:05,918 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:56:05,918 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:56:05,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:06,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:06,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:06,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 22:56:06,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:06,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:07,158 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:56:07,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 143 treesize of output 190 [2025-04-13 22:56:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:56:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178342895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:56:07,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:56:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 16] total 56 [2025-04-13 22:56:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083553107] [2025-04-13 22:56:07,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:56:07,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 22:56:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:07,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 22:56:07,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3011, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:56:07,309 INFO L87 Difference]: Start difference. First operand 4750 states and 13833 transitions. Second operand has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:57:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:15,264 INFO L93 Difference]: Finished difference Result 39241 states and 114090 transitions. [2025-04-13 22:57:15,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 684 states. [2025-04-13 22:57:15,264 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 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 35 [2025-04-13 22:57:15,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:15,347 INFO L225 Difference]: With dead ends: 39241 [2025-04-13 22:57:15,347 INFO L226 Difference]: Without dead ends: 35244 [2025-04-13 22:57:15,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234985 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=33313, Invalid=481493, Unknown=0, NotChecked=0, Total=514806 [2025-04-13 22:57:15,377 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 2488 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9510 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 9510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:15,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 34 Invalid, 10524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 9510 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-04-13 22:57:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35244 states. [2025-04-13 22:57:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35244 to 21782. [2025-04-13 22:57:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21782 states, 21781 states have (on average 2.89394426334879) internal successors, (63033), 21781 states have internal predecessors, (63033), 0 states have call successors, (0), 0 states have 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:57:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21782 states to 21782 states and 63033 transitions. [2025-04-13 22:57:15,929 INFO L79 Accepts]: Start accepts. Automaton has 21782 states and 63033 transitions. Word has length 35 [2025-04-13 22:57:15,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:15,929 INFO L485 AbstractCegarLoop]: Abstraction has 21782 states and 63033 transitions. [2025-04-13 22:57:15,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:57:15,930 INFO L278 IsEmpty]: Start isEmpty. Operand 21782 states and 63033 transitions. [2025-04-13 22:57:15,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:15,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:15,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:15,944 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:57:16,141 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,SelfDestructingSolverStorable39 [2025-04-13 22:57:16,141 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:57:16,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2138338914, now seen corresponding path program 3 times [2025-04-13 22:57:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:16,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274350794] [2025-04-13 22:57:16,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:16,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 22:57:16,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:16,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:57:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:57:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:16,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274350794] [2025-04-13 22:57:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274350794] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:57:16,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093827388] [2025-04-13 22:57:16,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:16,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:57:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:57:16,870 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:57:16,871 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:57:16,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 22:57:16,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:16,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:57:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:16,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 22:57:16,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:57:34,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,162 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:57:34,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:57:34,243 INFO L325 Elim1Store]: treesize reduction 24, result has 80.6 percent of original size [2025-04-13 22:57:34,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 74 treesize of output 125 [2025-04-13 22:57:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:57:37,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:57:45,574 INFO L325 Elim1Store]: treesize reduction 16, result has 97.8 percent of original size [2025-04-13 22:57:45,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 269 treesize of output 861 [2025-04-13 22:58:02,351 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 22:58:02,743 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 22:58:03,232 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 22:58:03,343 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 22:58:03,751 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 22:58:11,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 22:58:11,314 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 22:58:11,315 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 22:58:11,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 22:58:11,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:11,516 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 22:58:11,521 INFO L158 Benchmark]: Toolchain (without parser) took 774964.56ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 90.3MB in the beginning and 911.3MB in the end (delta: -821.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.70ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 75.4MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.23ms. Allocated memory is still 125.8MB. Free memory was 75.4MB in the beginning and 73.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: IcfgBuilder took 512.52ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 28.8MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 22:58:11,521 INFO L158 Benchmark]: TraceAbstraction took 774114.10ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 28.3MB in the beginning and 911.3MB in the end (delta: -883.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 22:58:11,522 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.70ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 75.4MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.23ms. Allocated memory is still 125.8MB. Free memory was 75.4MB in the beginning and 73.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 512.52ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 28.8MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 774114.10ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 28.3MB in the beginning and 911.3MB in the end (delta: -883.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...