/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:06:13,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:06:13,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:06:13,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:06:13,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:06:13,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:06:13,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:06:13,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:06:13,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:06:13,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:06:13,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:06:13,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:06:13,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:06:13,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:06:13,347 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:06:13,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:06:13,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:06:13,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:06:13,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:06:13,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:06:13,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:06:13,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:06:13,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:13,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:06:13,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:13,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:06:13,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:06:13,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:06:13,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:06:13,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:06:13,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:06:13,551 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:06:13,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2025-04-13 17:06:14,840 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7893edbd2/60c481c16d3a4fb8a288818c8a44488f/FLAGa0d534a01 [2025-04-13 17:06:15,069 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:06:15,072 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2025-04-13 17:06:15,086 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7893edbd2/60c481c16d3a4fb8a288818c8a44488f/FLAGa0d534a01 [2025-04-13 17:06:15,891 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7893edbd2/60c481c16d3a4fb8a288818c8a44488f [2025-04-13 17:06:15,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:06:15,895 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:06:15,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:15,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:06:15,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:06:15,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:15" (1/1) ... [2025-04-13 17:06:15,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a03ddd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:15, skipping insertion in model container [2025-04-13 17:06:15,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:15" (1/1) ... [2025-04-13 17:06:15,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:06:16,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2025-04-13 17:06:16,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:16,323 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:06:16,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2025-04-13 17:06:16,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:16,452 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:06:16,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16 WrapperNode [2025-04-13 17:06:16,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:16,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:16,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:06:16,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:06:16,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,518 INFO L138 Inliner]: procedures = 277, calls = 430, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 539 [2025-04-13 17:06:16,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:16,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:06:16,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:06:16,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:06:16,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,563 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 17:06:16,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:06:16,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:06:16,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:06:16,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:06:16,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (1/1) ... [2025-04-13 17:06:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:16,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:06:16,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:06:16,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:06:16,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:06:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:06:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:06:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:06:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:06:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:06:16,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:06:16,635 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:06:16,734 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:06:16,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:06:17,283 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:06:17,284 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:06:17,284 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:06:20,552 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:20,553 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:20,555 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:06:20,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:20 BoogieIcfgContainer [2025-04-13 17:06:20,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:06:20,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:06:20,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:06:20,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:06:20,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:06:15" (1/3) ... [2025-04-13 17:06:20,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1959a925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:20, skipping insertion in model container [2025-04-13 17:06:20,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:16" (2/3) ... [2025-04-13 17:06:20,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1959a925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:20, skipping insertion in model container [2025-04-13 17:06:20,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:20" (3/3) ... [2025-04-13 17:06:20,563 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-04-13 17:06:20,576 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:06:20,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 17:06:20,578 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:06:20,633 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:06:20,654 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 17:06:20,679 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:20,702 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:06:20,712 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;@7bcf1d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:06:20,712 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:06:20,715 INFO L278 IsEmpty]: Start isEmpty. Operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:20,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:06:20,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:20,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:06:20,720 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:20,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1138374711, now seen corresponding path program 1 times [2025-04-13 17:06:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:20,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523117] [2025-04-13 17:06:20,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:06:20,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:06:20,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:20,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:21,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523117] [2025-04-13 17:06:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:06:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654752689] [2025-04-13 17:06:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:21,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:21,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:21,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:06:21,277 INFO L87 Difference]: Start difference. First operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:21,371 INFO L93 Difference]: Finished difference Result 200 states and 488 transitions. [2025-04-13 17:06:21,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:21,374 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-13 17:06:21,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:21,380 INFO L225 Difference]: With dead ends: 200 [2025-04-13 17:06:21,381 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 17:06:21,384 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 17:06:21,386 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:21,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 17:06:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-13 17:06:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 2.4468085106382977) internal successors, (345), 143 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 345 transitions. [2025-04-13 17:06:21,418 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 345 transitions. Word has length 5 [2025-04-13 17:06:21,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:21,418 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 345 transitions. [2025-04-13 17:06:21,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:21,418 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 345 transitions. [2025-04-13 17:06:21,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:06:21,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:21,419 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:21,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:06:21,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:21,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -516176486, now seen corresponding path program 1 times [2025-04-13 17:06:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:21,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170942427] [2025-04-13 17:06:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:21,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:06:21,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:06:21,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:21,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:21,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170942427] [2025-04-13 17:06:21,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170942427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:21,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742324513] [2025-04-13 17:06:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:21,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:21,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 17:06:21,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:06:21,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:06:21,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:21,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:21,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:06:21,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:21,967 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 8 treesize of output 1 [2025-04-13 17:06:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:22,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742324513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:22,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 17:06:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955451432] [2025-04-13 17:06:22,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:22,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:06:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:22,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:06:22,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:06:22,031 INFO L87 Difference]: Start difference. First operand 144 states and 345 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:22,213 INFO L93 Difference]: Finished difference Result 561 states and 1392 transitions. [2025-04-13 17:06:22,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:22,214 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-13 17:06:22,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:22,217 INFO L225 Difference]: With dead ends: 561 [2025-04-13 17:06:22,217 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 17:06:22,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:06:22,218 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:22,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 17:06:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 429. [2025-04-13 17:06:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 426 states have (on average 2.5539906103286385) internal successors, (1088), 428 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1088 transitions. [2025-04-13 17:06:22,254 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1088 transitions. Word has length 9 [2025-04-13 17:06:22,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:22,254 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1088 transitions. [2025-04-13 17:06:22,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,254 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1088 transitions. [2025-04-13 17:06:22,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:22,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:22,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:22,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:22,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:22,456 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:22,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash -654906588, now seen corresponding path program 1 times [2025-04-13 17:06:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:22,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698229072] [2025-04-13 17:06:22,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:22,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:22,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:22,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:22,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698229072] [2025-04-13 17:06:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698229072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:06:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280671700] [2025-04-13 17:06:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:22,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:22,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:22,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:06:22,638 INFO L87 Difference]: Start difference. First operand 429 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:22,692 INFO L93 Difference]: Finished difference Result 639 states and 1647 transitions. [2025-04-13 17:06:22,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:22,693 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 17:06:22,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:22,695 INFO L225 Difference]: With dead ends: 639 [2025-04-13 17:06:22,695 INFO L226 Difference]: Without dead ends: 312 [2025-04-13 17:06:22,696 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 17:06:22,696 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:22,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:06:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-13 17:06:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 296. [2025-04-13 17:06:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 292 states have (on average 2.4315068493150687) internal successors, (710), 295 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 710 transitions. [2025-04-13 17:06:22,711 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 710 transitions. Word has length 10 [2025-04-13 17:06:22,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:22,711 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 710 transitions. [2025-04-13 17:06:22,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:22,711 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 710 transitions. [2025-04-13 17:06:22,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:06:22,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:22,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:22,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:06:22,712 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:22,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1172642108, now seen corresponding path program 1 times [2025-04-13 17:06:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:22,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66216076] [2025-04-13 17:06:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:22,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:06:22,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:06:22,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:22,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:23,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66216076] [2025-04-13 17:06:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66216076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:23,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:06:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998679351] [2025-04-13 17:06:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:23,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:06:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:23,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:06:23,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:06:23,384 INFO L87 Difference]: Start difference. First operand 296 states and 710 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:23,458 INFO L93 Difference]: Finished difference Result 382 states and 900 transitions. [2025-04-13 17:06:23,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:06:23,459 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 17:06:23,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:23,461 INFO L225 Difference]: With dead ends: 382 [2025-04-13 17:06:23,461 INFO L226 Difference]: Without dead ends: 361 [2025-04-13 17:06:23,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 17:06:23,462 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:23,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-13 17:06:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 315. [2025-04-13 17:06:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 2.446945337620579) internal successors, (761), 314 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 761 transitions. [2025-04-13 17:06:23,478 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 761 transitions. Word has length 11 [2025-04-13 17:06:23,478 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:23,478 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 761 transitions. [2025-04-13 17:06:23,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:23,478 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 761 transitions. [2025-04-13 17:06:23,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:06:23,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:23,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:23,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:06:23,479 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:23,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1185895137, now seen corresponding path program 1 times [2025-04-13 17:06:23,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:23,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207991342] [2025-04-13 17:06:23,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:23,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:06:23,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:06:23,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:23,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:24,094 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 17:06:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:24,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207991342] [2025-04-13 17:06:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207991342] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:24,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934224822] [2025-04-13 17:06:24,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:24,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:24,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 17:06:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:06:24,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:06:24,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:24,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:24,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:06:24,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:24,315 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 25 treesize of output 1 [2025-04-13 17:06:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:24,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:06:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934224822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:06:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 17:06:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551338465] [2025-04-13 17:06:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:24,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:24,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:24,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:24,368 INFO L87 Difference]: Start difference. First operand 315 states and 761 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:24,434 INFO L93 Difference]: Finished difference Result 363 states and 869 transitions. [2025-04-13 17:06:24,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:24,434 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 17:06:24,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:24,436 INFO L225 Difference]: With dead ends: 363 [2025-04-13 17:06:24,436 INFO L226 Difference]: Without dead ends: 347 [2025-04-13 17:06:24,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:24,439 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:24,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-13 17:06:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 299. [2025-04-13 17:06:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 295 states have (on average 2.4237288135593222) internal successors, (715), 298 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 715 transitions. [2025-04-13 17:06:24,451 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 715 transitions. Word has length 15 [2025-04-13 17:06:24,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:24,451 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 715 transitions. [2025-04-13 17:06:24,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:24,452 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 715 transitions. [2025-04-13 17:06:24,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:06:24,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:24,454 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:24,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:06:24,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:24,656 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:24,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1378977632, now seen corresponding path program 1 times [2025-04-13 17:06:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:24,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609503856] [2025-04-13 17:06:24,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:24,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:24,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:24,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:24,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:24,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609503856] [2025-04-13 17:06:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609503856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:24,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721309879] [2025-04-13 17:06:24,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:24,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:24,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:24,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:24,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 17:06:25,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:25,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:25,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:25,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:06:25,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:25,144 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 8 treesize of output 1 [2025-04-13 17:06:25,173 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 8 treesize of output 1 [2025-04-13 17:06:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:25,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721309879] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:06:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 17:06:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131100777] [2025-04-13 17:06:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:25,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:06:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:25,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:06:25,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:06:25,499 INFO L87 Difference]: Start difference. First operand 299 states and 715 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:25,605 INFO L93 Difference]: Finished difference Result 403 states and 960 transitions. [2025-04-13 17:06:25,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:06:25,606 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:06:25,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:25,608 INFO L225 Difference]: With dead ends: 403 [2025-04-13 17:06:25,608 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 17:06:25,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:06:25,609 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:25,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 17:06:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 301. [2025-04-13 17:06:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 297 states have (on average 2.451178451178451) internal successors, (728), 300 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 728 transitions. [2025-04-13 17:06:25,616 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 728 transitions. Word has length 19 [2025-04-13 17:06:25,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:25,616 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 728 transitions. [2025-04-13 17:06:25,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:25,617 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 728 transitions. [2025-04-13 17:06:25,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:06:25,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:25,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:25,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:06:25,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:25,818 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:25,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 455166082, now seen corresponding path program 1 times [2025-04-13 17:06:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:25,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533346705] [2025-04-13 17:06:25,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:25,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:25,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:25,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:25,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:26,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533346705] [2025-04-13 17:06:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533346705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:26,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40556500] [2025-04-13 17:06:26,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:26,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:26,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:26,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 17:06:26,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:26,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:26,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:26,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:06:26,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:26,837 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 17:06:26,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:26,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:27,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40556500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:27,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:27,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-13 17:06:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514628646] [2025-04-13 17:06:27,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:27,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:06:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:27,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:06:27,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:06:27,245 INFO L87 Difference]: Start difference. First operand 301 states and 728 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:27,579 INFO L93 Difference]: Finished difference Result 662 states and 1580 transitions. [2025-04-13 17:06:27,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:06:27,580 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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 17:06:27,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:27,583 INFO L225 Difference]: With dead ends: 662 [2025-04-13 17:06:27,583 INFO L226 Difference]: Without dead ends: 602 [2025-04-13 17:06:27,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:06:27,584 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:27,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-04-13 17:06:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 409. [2025-04-13 17:06:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 2.4790123456790125) internal successors, (1004), 408 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1004 transitions. [2025-04-13 17:06:27,600 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 1004 transitions. Word has length 19 [2025-04-13 17:06:27,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:27,601 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 1004 transitions. [2025-04-13 17:06:27,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:27,601 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 1004 transitions. [2025-04-13 17:06:27,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:06:27,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:27,601 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 17:06:27,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:27,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:27,806 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:27,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1570698435, now seen corresponding path program 2 times [2025-04-13 17:06:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:27,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091434526] [2025-04-13 17:06:27,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:27,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:06:27,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:06:27,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:28,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091434526] [2025-04-13 17:06:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091434526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:28,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926423865] [2025-04-13 17:06:28,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:28,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 17:06:28,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:06:28,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:06:28,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:28,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:28,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:06:28,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:28,345 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 8 treesize of output 1 [2025-04-13 17:06:28,366 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 8 treesize of output 1 [2025-04-13 17:06:28,383 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 8 treesize of output 1 [2025-04-13 17:06:28,402 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 8 treesize of output 1 [2025-04-13 17:06:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:28,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926423865] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:28,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 17:06:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507838560] [2025-04-13 17:06:28,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:28,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:06:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:06:28,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:06:28,481 INFO L87 Difference]: Start difference. First operand 409 states and 1004 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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 17:06:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:28,977 INFO L93 Difference]: Finished difference Result 2049 states and 5061 transitions. [2025-04-13 17:06:28,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:06:28,978 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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 21 [2025-04-13 17:06:28,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:28,986 INFO L225 Difference]: With dead ends: 2049 [2025-04-13 17:06:28,986 INFO L226 Difference]: Without dead ends: 2039 [2025-04-13 17:06:28,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:06:28,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 442 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:28,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 0 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-04-13 17:06:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1343. [2025-04-13 17:06:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1339 states have (on average 2.6639283047050037) internal successors, (3567), 1342 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 3567 transitions. [2025-04-13 17:06:29,039 INFO L79 Accepts]: Start accepts. Automaton has 1343 states and 3567 transitions. Word has length 21 [2025-04-13 17:06:29,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:29,039 INFO L485 AbstractCegarLoop]: Abstraction has 1343 states and 3567 transitions. [2025-04-13 17:06:29,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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 17:06:29,041 INFO L278 IsEmpty]: Start isEmpty. Operand 1343 states and 3567 transitions. [2025-04-13 17:06:29,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:06:29,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:29,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:29,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 17:06:29,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:29,246 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:29,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 141906376, now seen corresponding path program 2 times [2025-04-13 17:06:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:29,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594467413] [2025-04-13 17:06:29,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:29,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:06:29,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:06:29,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:29,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:30,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594467413] [2025-04-13 17:06:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594467413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:30,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121505743] [2025-04-13 17:06:30,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:30,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:30,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 17:06:30,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:06:30,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:06:30,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:30,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:30,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 17:06:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:30,790 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 17:06:30,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:06:30,863 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:06:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:31,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121505743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:31,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 17:06:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545534362] [2025-04-13 17:06:31,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:31,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:06:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:31,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:06:31,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:06:31,910 INFO L87 Difference]: Start difference. First operand 1343 states and 3567 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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 17:06:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:33,256 INFO L93 Difference]: Finished difference Result 3975 states and 10175 transitions. [2025-04-13 17:06:33,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:06:33,256 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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 27 [2025-04-13 17:06:33,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:33,272 INFO L225 Difference]: With dead ends: 3975 [2025-04-13 17:06:33,272 INFO L226 Difference]: Without dead ends: 3855 [2025-04-13 17:06:33,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:06:33,274 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 429 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:33,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 0 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:06:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2025-04-13 17:06:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 2772. [2025-04-13 17:06:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2768 states have (on average 2.790462427745665) internal successors, (7724), 2771 states have internal predecessors, (7724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 7724 transitions. [2025-04-13 17:06:33,349 INFO L79 Accepts]: Start accepts. Automaton has 2772 states and 7724 transitions. Word has length 27 [2025-04-13 17:06:33,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:33,350 INFO L485 AbstractCegarLoop]: Abstraction has 2772 states and 7724 transitions. [2025-04-13 17:06:33,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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 17:06:33,351 INFO L278 IsEmpty]: Start isEmpty. Operand 2772 states and 7724 transitions. [2025-04-13 17:06:33,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:06:33,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:33,354 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:33,364 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 17:06:33,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:33,557 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:33,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash 378187910, now seen corresponding path program 1 times [2025-04-13 17:06:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:33,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701905519] [2025-04-13 17:06:33,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:33,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:06:33,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:33,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:33,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701905519] [2025-04-13 17:06:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701905519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:33,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206310496] [2025-04-13 17:06:33,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:33,951 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 17:06:33,952 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 17:06:34,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:06:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:06:34,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:34,154 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 8 treesize of output 1 [2025-04-13 17:06:34,180 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 8 treesize of output 1 [2025-04-13 17:06:34,197 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 8 treesize of output 1 [2025-04-13 17:06:34,217 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 8 treesize of output 1 [2025-04-13 17:06:34,235 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 8 treesize of output 1 [2025-04-13 17:06:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:34,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:06:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206310496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:34,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 19 [2025-04-13 17:06:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794676438] [2025-04-13 17:06:34,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:34,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 17:06:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 17:06:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:06:34,531 INFO L87 Difference]: Start difference. First operand 2772 states and 7724 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:35,013 INFO L93 Difference]: Finished difference Result 7140 states and 19296 transitions. [2025-04-13 17:06:35,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:06:35,014 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 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 17:06:35,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:35,042 INFO L225 Difference]: With dead ends: 7140 [2025-04-13 17:06:35,042 INFO L226 Difference]: Without dead ends: 7064 [2025-04-13 17:06:35,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:06:35,045 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:35,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7064 states. [2025-04-13 17:06:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7064 to 4205. [2025-04-13 17:06:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4205 states, 4201 states have (on average 2.767674363246846) internal successors, (11627), 4204 states have internal predecessors, (11627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 11627 transitions. [2025-04-13 17:06:35,161 INFO L79 Accepts]: Start accepts. Automaton has 4205 states and 11627 transitions. Word has length 35 [2025-04-13 17:06:35,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:35,162 INFO L485 AbstractCegarLoop]: Abstraction has 4205 states and 11627 transitions. [2025-04-13 17:06:35,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:35,162 INFO L278 IsEmpty]: Start isEmpty. Operand 4205 states and 11627 transitions. [2025-04-13 17:06:35,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:06:35,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:35,164 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:35,172 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 17:06:35,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:35,365 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:35,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -651741938, now seen corresponding path program 3 times [2025-04-13 17:06:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:35,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506893499] [2025-04-13 17:06:35,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:35,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:06:35,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:35,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:06:35,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:36,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506893499] [2025-04-13 17:06:36,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506893499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:36,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299129401] [2025-04-13 17:06:36,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:36,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:36,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:36,771 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 17:06:36,773 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 17:06:36,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:06:37,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:37,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:06:37,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:37,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:06:37,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:37,062 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 17:06:37,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:06:37,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:06:37,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:06:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:37,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299129401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:38,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-04-13 17:06:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94669109] [2025-04-13 17:06:38,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:06:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:06:38,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:06:38,139 INFO L87 Difference]: Start difference. First operand 4205 states and 11627 transitions. Second operand has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:39,039 INFO L93 Difference]: Finished difference Result 7895 states and 21001 transitions. [2025-04-13 17:06:39,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:06:39,040 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 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 17:06:39,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:39,150 INFO L225 Difference]: With dead ends: 7895 [2025-04-13 17:06:39,151 INFO L226 Difference]: Without dead ends: 7622 [2025-04-13 17:06:39,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:06:39,157 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:39,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:06:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2025-04-13 17:06:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 2189. [2025-04-13 17:06:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 2185 states have (on average 2.6787185354691077) internal successors, (5853), 2188 states have internal predecessors, (5853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 5853 transitions. [2025-04-13 17:06:39,281 INFO L79 Accepts]: Start accepts. Automaton has 2189 states and 5853 transitions. Word has length 35 [2025-04-13 17:06:39,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:39,282 INFO L485 AbstractCegarLoop]: Abstraction has 2189 states and 5853 transitions. [2025-04-13 17:06:39,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,282 INFO L278 IsEmpty]: Start isEmpty. Operand 2189 states and 5853 transitions. [2025-04-13 17:06:39,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 17:06:39,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:39,288 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:39,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 17:06:39,488 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,SelfDestructingSolverStorable10 [2025-04-13 17:06:39,489 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:39,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2028720858, now seen corresponding path program 2 times [2025-04-13 17:06:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:39,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261049026] [2025-04-13 17:06:39,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:39,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:39,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:39,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:39,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:39,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 2 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:40,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261049026] [2025-04-13 17:06:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261049026] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:40,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373660451] [2025-04-13 17:06:40,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:40,322 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 17:06:40,324 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 17:06:40,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:40,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:40,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:06:40,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:40,554 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 8 treesize of output 1 [2025-04-13 17:06:40,570 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 8 treesize of output 1 [2025-04-13 17:06:40,587 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 8 treesize of output 1 [2025-04-13 17:06:40,605 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 8 treesize of output 1 [2025-04-13 17:06:40,624 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 8 treesize of output 1 [2025-04-13 17:06:40,643 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 8 treesize of output 1 [2025-04-13 17:06:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:06:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373660451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:41,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-13 17:06:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595352416] [2025-04-13 17:06:41,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:41,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:06:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:06:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:06:41,154 INFO L87 Difference]: Start difference. First operand 2189 states and 5853 transitions. Second operand has 26 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:42,104 INFO L93 Difference]: Finished difference Result 6299 states and 16355 transitions. [2025-04-13 17:06:42,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:06:42,104 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 17:06:42,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:42,117 INFO L225 Difference]: With dead ends: 6299 [2025-04-13 17:06:42,117 INFO L226 Difference]: Without dead ends: 6202 [2025-04-13 17:06:42,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=688, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:06:42,119 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:42,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:06:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2025-04-13 17:06:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 2529. [2025-04-13 17:06:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2525 states have (on average 2.6950495049504952) internal successors, (6805), 2528 states have internal predecessors, (6805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 6805 transitions. [2025-04-13 17:06:42,234 INFO L79 Accepts]: Start accepts. Automaton has 2529 states and 6805 transitions. Word has length 43 [2025-04-13 17:06:42,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:42,234 INFO L485 AbstractCegarLoop]: Abstraction has 2529 states and 6805 transitions. [2025-04-13 17:06:42,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:42,235 INFO L278 IsEmpty]: Start isEmpty. Operand 2529 states and 6805 transitions. [2025-04-13 17:06:42,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 17:06:42,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:42,237 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:42,246 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 17:06:42,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:42,438 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:42,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -763563436, now seen corresponding path program 4 times [2025-04-13 17:06:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:42,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186639043] [2025-04-13 17:06:42,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:42,624 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:42,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:42,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:44,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186639043] [2025-04-13 17:06:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186639043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:44,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203558225] [2025-04-13 17:06:44,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:44,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:44,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:44,103 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 17:06:44,104 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 17:06:44,208 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:44,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:44,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:06:44,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:44,341 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 17:06:44,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 19 [2025-04-13 17:06:44,482 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:06:44,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:06:44,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 19 [2025-04-13 17:06:44,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 19 [2025-04-13 17:06:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:45,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203558225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:46,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:46,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2025-04-13 17:06:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977583060] [2025-04-13 17:06:46,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:46,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:06:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:46,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:06:46,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:06:46,405 INFO L87 Difference]: Start difference. First operand 2529 states and 6805 transitions. Second operand has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 29 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:51,251 INFO L93 Difference]: Finished difference Result 12415 states and 31288 transitions. [2025-04-13 17:06:51,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 17:06:51,252 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 29 states have internal predecessors, (129), 0 states have call successors, (0), 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 43 [2025-04-13 17:06:51,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:51,277 INFO L225 Difference]: With dead ends: 12415 [2025-04-13 17:06:51,277 INFO L226 Difference]: Without dead ends: 11785 [2025-04-13 17:06:51,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1590, Invalid=5382, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 17:06:51,287 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 698 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:51,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 0 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 17:06:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2025-04-13 17:06:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 4187. [2025-04-13 17:06:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 4183 states have (on average 2.8448481950753046) internal successors, (11900), 4186 states have internal predecessors, (11900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 11900 transitions. [2025-04-13 17:06:51,438 INFO L79 Accepts]: Start accepts. Automaton has 4187 states and 11900 transitions. Word has length 43 [2025-04-13 17:06:51,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:51,439 INFO L485 AbstractCegarLoop]: Abstraction has 4187 states and 11900 transitions. [2025-04-13 17:06:51,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 29 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:51,439 INFO L278 IsEmpty]: Start isEmpty. Operand 4187 states and 11900 transitions. [2025-04-13 17:06:51,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 17:06:51,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:51,441 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-04-13 17:06:51,451 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 17:06:51,646 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,SelfDestructingSolverStorable12 [2025-04-13 17:06:51,646 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:51,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -336448875, now seen corresponding path program 3 times [2025-04-13 17:06:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:51,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311225275] [2025-04-13 17:06:51,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:51,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 17:06:51,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 17:06:51,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:51,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:52,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311225275] [2025-04-13 17:06:52,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311225275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:52,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013499512] [2025-04-13 17:06:52,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:52,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:52,320 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 17:06:52,322 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 17:06:52,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 17:06:52,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 17:06:52,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:52,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:52,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:06:52,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:52,943 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 8 treesize of output 1 [2025-04-13 17:06:52,956 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 8 treesize of output 1 [2025-04-13 17:06:52,967 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 8 treesize of output 1 [2025-04-13 17:06:52,980 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 8 treesize of output 1 [2025-04-13 17:06:52,993 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 8 treesize of output 1 [2025-04-13 17:06:53,005 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 8 treesize of output 1 [2025-04-13 17:06:53,019 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 8 treesize of output 1 [2025-04-13 17:06:53,032 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 8 treesize of output 1 [2025-04-13 17:06:53,048 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 8 treesize of output 1 [2025-04-13 17:06:53,063 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 8 treesize of output 1 [2025-04-13 17:06:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:53,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013499512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:53,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:53,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2025-04-13 17:06:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360789931] [2025-04-13 17:06:53,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:53,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:06:53,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:53,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:06:53,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:06:53,208 INFO L87 Difference]: Start difference. First operand 4187 states and 11900 transitions. Second operand has 34 states, 33 states have (on average 3.9696969696969697) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:55,446 INFO L93 Difference]: Finished difference Result 36539 states and 106217 transitions. [2025-04-13 17:06:55,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 17:06:55,447 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.9696969696969697) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 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 45 [2025-04-13 17:06:55,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:55,537 INFO L225 Difference]: With dead ends: 36539 [2025-04-13 17:06:55,537 INFO L226 Difference]: Without dead ends: 36529 [2025-04-13 17:06:55,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2995 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2606, Invalid=5226, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 17:06:55,557 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2764 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:55,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 0 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:06:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36529 states. [2025-04-13 17:06:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36529 to 24673. [2025-04-13 17:06:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24673 states, 24669 states have (on average 2.9952977421054765) internal successors, (73891), 24672 states have internal predecessors, (73891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24673 states to 24673 states and 73891 transitions. [2025-04-13 17:06:56,150 INFO L79 Accepts]: Start accepts. Automaton has 24673 states and 73891 transitions. Word has length 45 [2025-04-13 17:06:56,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:56,150 INFO L485 AbstractCegarLoop]: Abstraction has 24673 states and 73891 transitions. [2025-04-13 17:06:56,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.9696969696969697) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:56,151 INFO L278 IsEmpty]: Start isEmpty. Operand 24673 states and 73891 transitions. [2025-04-13 17:06:56,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 17:06:56,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:56,153 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:56,164 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 17:06:56,354 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,SelfDestructingSolverStorable13 [2025-04-13 17:06:56,354 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:56,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1279489638, now seen corresponding path program 5 times [2025-04-13 17:06:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:56,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471672459] [2025-04-13 17:06:56,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:56,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 17:06:56,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 17:06:56,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:06:56,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:58,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471672459] [2025-04-13 17:06:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471672459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:58,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112745176] [2025-04-13 17:06:58,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:58,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:58,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:58,161 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 17:06:58,162 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 17:06:58,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 17:06:58,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 17:06:58,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:06:58,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:58,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 17:06:58,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:58,616 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 17:06:58,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:58,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:58,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:58,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:58,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:06:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:59,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112745176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:01,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 12] total 38 [2025-04-13 17:07:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943044657] [2025-04-13 17:07:01,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:01,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:07:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:07:01,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:07:01,132 INFO L87 Difference]: Start difference. First operand 24673 states and 73891 transitions. Second operand has 39 states, 38 states have (on average 4.026315789473684) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:05,109 INFO L93 Difference]: Finished difference Result 39421 states and 115718 transitions. [2025-04-13 17:07:05,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:07:05,109 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.026315789473684) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-13 17:07:05,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:05,211 INFO L225 Difference]: With dead ends: 39421 [2025-04-13 17:07:05,212 INFO L226 Difference]: Without dead ends: 38834 [2025-04-13 17:07:05,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1000, Invalid=3830, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 17:07:05,233 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 610 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4271 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:05,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 0 Invalid, 4364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4271 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 17:07:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38834 states. [2025-04-13 17:07:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38834 to 27135. [2025-04-13 17:07:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27135 states, 27131 states have (on average 3.0045704176034795) internal successors, (81517), 27134 states have internal predecessors, (81517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27135 states to 27135 states and 81517 transitions. [2025-04-13 17:07:05,962 INFO L79 Accepts]: Start accepts. Automaton has 27135 states and 81517 transitions. Word has length 51 [2025-04-13 17:07:05,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:05,962 INFO L485 AbstractCegarLoop]: Abstraction has 27135 states and 81517 transitions. [2025-04-13 17:07:05,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.026315789473684) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:05,963 INFO L278 IsEmpty]: Start isEmpty. Operand 27135 states and 81517 transitions. [2025-04-13 17:07:05,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-13 17:07:05,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:05,966 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:07:05,977 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 17:07:06,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 17:07:06,167 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:06,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1238631712, now seen corresponding path program 6 times [2025-04-13 17:07:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:06,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769941795] [2025-04-13 17:07:06,169 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:07:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:06,192 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 7 equivalence classes. [2025-04-13 17:07:06,609 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 17:07:06,609 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-13 17:07:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:08,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769941795] [2025-04-13 17:07:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769941795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:08,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394077598] [2025-04-13 17:07:08,982 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:07:08,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:08,984 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 17:07:08,985 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 17:07:09,130 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 7 equivalence classes. [2025-04-13 17:07:09,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 17:07:09,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-13 17:07:09,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:09,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 17:07:09,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:09,908 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 17:07:09,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:09,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:10,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:10,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:10,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:10,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 17:07:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:11,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 12 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394077598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:13,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 37 [2025-04-13 17:07:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387709910] [2025-04-13 17:07:13,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:13,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:07:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:13,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:07:13,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:07:13,199 INFO L87 Difference]: Start difference. First operand 27135 states and 81517 transitions. Second operand has 38 states, 37 states have (on average 4.783783783783784) internal successors, (177), 38 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:17,336 INFO L93 Difference]: Finished difference Result 42163 states and 124062 transitions. [2025-04-13 17:07:17,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:07:17,337 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.783783783783784) internal successors, (177), 38 states have internal predecessors, (177), 0 states have call successors, (0), 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 59 [2025-04-13 17:07:17,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:17,468 INFO L225 Difference]: With dead ends: 42163 [2025-04-13 17:07:17,468 INFO L226 Difference]: Without dead ends: 41839 [2025-04-13 17:07:17,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1018, Invalid=3404, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:07:17,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 799 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3947 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:17,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 0 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3947 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 17:07:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41839 states. [2025-04-13 17:07:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41839 to 27763. [2025-04-13 17:07:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27763 states, 27759 states have (on average 2.989913181310566) internal successors, (82997), 27762 states have internal predecessors, (82997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27763 states to 27763 states and 82997 transitions. [2025-04-13 17:07:18,165 INFO L79 Accepts]: Start accepts. Automaton has 27763 states and 82997 transitions. Word has length 59 [2025-04-13 17:07:18,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:18,165 INFO L485 AbstractCegarLoop]: Abstraction has 27763 states and 82997 transitions. [2025-04-13 17:07:18,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.783783783783784) internal successors, (177), 38 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:18,165 INFO L278 IsEmpty]: Start isEmpty. Operand 27763 states and 82997 transitions. [2025-04-13 17:07:18,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-13 17:07:18,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:18,169 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:07:18,182 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 17:07:18,369 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,SelfDestructingSolverStorable15 [2025-04-13 17:07:18,370 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:18,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1162049595, now seen corresponding path program 3 times [2025-04-13 17:07:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:18,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468456257] [2025-04-13 17:07:18,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:07:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:18,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 12 equivalence classes. [2025-04-13 17:07:18,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 63 statements. [2025-04-13 17:07:18,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:07:18,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-04-13 17:07:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:18,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468456257] [2025-04-13 17:07:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468456257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:18,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392896120] [2025-04-13 17:07:18,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:07:18,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:18,647 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 17:07:18,648 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 17:07:18,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 12 equivalence classes. [2025-04-13 17:07:18,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 63 statements. [2025-04-13 17:07:18,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:07:18,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:18,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:07:18,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:18,890 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 8 treesize of output 1 [2025-04-13 17:07:19,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 74 treesize of output 59 [2025-04-13 17:07:19,384 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:19,384 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 81 [2025-04-13 17:07:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-04-13 17:07:19,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-04-13 17:07:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392896120] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:19,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-04-13 17:07:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295822346] [2025-04-13 17:07:19,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:19,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:07:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:19,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:07:19,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:07:19,624 INFO L87 Difference]: Start difference. First operand 27763 states and 82997 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:20,178 INFO L93 Difference]: Finished difference Result 47874 states and 137952 transitions. [2025-04-13 17:07:20,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:07:20,179 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 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 63 [2025-04-13 17:07:20,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:20,336 INFO L225 Difference]: With dead ends: 47874 [2025-04-13 17:07:20,337 INFO L226 Difference]: Without dead ends: 47868 [2025-04-13 17:07:20,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:07:20,359 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:20,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:07:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47868 states. [2025-04-13 17:07:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47868 to 35313. [2025-04-13 17:07:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35313 states, 35309 states have (on average 2.9674020787901103) internal successors, (104776), 35312 states have internal predecessors, (104776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35313 states to 35313 states and 104776 transitions. [2025-04-13 17:07:21,273 INFO L79 Accepts]: Start accepts. Automaton has 35313 states and 104776 transitions. Word has length 63 [2025-04-13 17:07:21,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:21,273 INFO L485 AbstractCegarLoop]: Abstraction has 35313 states and 104776 transitions. [2025-04-13 17:07:21,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:21,274 INFO L278 IsEmpty]: Start isEmpty. Operand 35313 states and 104776 transitions. [2025-04-13 17:07:21,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 17:07:21,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:21,278 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:07:21,286 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 17:07:21,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:21,479 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:21,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1027791880, now seen corresponding path program 4 times [2025-04-13 17:07:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:21,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220621723] [2025-04-13 17:07:21,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:07:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:21,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 17:07:21,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:07:21,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:07:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:22,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220621723] [2025-04-13 17:07:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220621723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:22,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967780201] [2025-04-13 17:07:22,545 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:07:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:22,547 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 17:07:22,548 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 17:07:22,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 17:07:22,860 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:07:22,860 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:07:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:22,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:07:22,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:22,884 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 8 treesize of output 1 [2025-04-13 17:07:22,901 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 8 treesize of output 1 [2025-04-13 17:07:22,916 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 8 treesize of output 1 [2025-04-13 17:07:22,935 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 8 treesize of output 1 [2025-04-13 17:07:22,954 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 8 treesize of output 1 [2025-04-13 17:07:22,976 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 8 treesize of output 1 [2025-04-13 17:07:22,995 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 8 treesize of output 1 [2025-04-13 17:07:23,013 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 8 treesize of output 1 [2025-04-13 17:07:23,032 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 8 treesize of output 1 [2025-04-13 17:07:23,049 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 8 treesize of output 1 [2025-04-13 17:07:23,069 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 8 treesize of output 1 [2025-04-13 17:07:23,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 31 [2025-04-13 17:07:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:23,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 67 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-04-13 17:07:23,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967780201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:23,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 7] total 35 [2025-04-13 17:07:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450959391] [2025-04-13 17:07:23,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:23,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:07:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:23,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:07:23,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:07:23,557 INFO L87 Difference]: Start difference. First operand 35313 states and 104776 transitions. Second operand has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:25,659 INFO L93 Difference]: Finished difference Result 130070 states and 378702 transitions. [2025-04-13 17:07:25,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:07:25,660 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 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 67 [2025-04-13 17:07:25,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:26,097 INFO L225 Difference]: With dead ends: 130070 [2025-04-13 17:07:26,097 INFO L226 Difference]: Without dead ends: 129469 [2025-04-13 17:07:26,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=614, Invalid=1366, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:07:26,153 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 618 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:26,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 0 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:07:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129469 states. [2025-04-13 17:07:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129469 to 41485. [2025-04-13 17:07:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41485 states, 41481 states have (on average 2.958149514235433) internal successors, (122707), 41484 states have internal predecessors, (122707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41485 states to 41485 states and 122707 transitions. [2025-04-13 17:07:28,134 INFO L79 Accepts]: Start accepts. Automaton has 41485 states and 122707 transitions. Word has length 67 [2025-04-13 17:07:28,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:28,135 INFO L485 AbstractCegarLoop]: Abstraction has 41485 states and 122707 transitions. [2025-04-13 17:07:28,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:28,135 INFO L278 IsEmpty]: Start isEmpty. Operand 41485 states and 122707 transitions. [2025-04-13 17:07:28,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 17:07:28,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:28,139 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:07:28,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 17:07:28,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 17:07:28,339 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:28,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1928247770, now seen corresponding path program 7 times [2025-04-13 17:07:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:28,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459780211] [2025-04-13 17:07:28,340 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:07:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 17:07:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:07:28,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:07:28,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:31,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459780211] [2025-04-13 17:07:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459780211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:31,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107222142] [2025-04-13 17:07:31,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:07:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:31,086 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 17:07:31,087 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 17:07:31,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 17:07:31,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:07:31,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:07:31,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:31,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:07:31,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:31,395 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 17:07:31,446 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:07:31,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:07:31,531 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:07:31,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:07:31,603 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:07:31,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:07:31,702 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:07:31,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:07:31,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 19 [2025-04-13 17:07:31,911 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 17:07:31,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 17:07:32,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 19 [2025-04-13 17:07:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:34,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107222142] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:36,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 42 [2025-04-13 17:07:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740124995] [2025-04-13 17:07:36,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:36,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:07:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:36,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:07:36,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:07:36,455 INFO L87 Difference]: Start difference. First operand 41485 states and 122707 transitions. Second operand has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:08:01,563 INFO L93 Difference]: Finished difference Result 117089 states and 322152 transitions. [2025-04-13 17:08:01,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2025-04-13 17:08:01,563 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 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 67 [2025-04-13 17:08:01,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:08:01,997 INFO L225 Difference]: With dead ends: 117089 [2025-04-13 17:08:01,998 INFO L226 Difference]: Without dead ends: 115235 [2025-04-13 17:08:02,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12524 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=7759, Invalid=28531, Unknown=0, NotChecked=0, Total=36290 [2025-04-13 17:08:02,063 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1588 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7360 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 7360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:08:02,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 0 Invalid, 7527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 7360 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-04-13 17:08:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115235 states. [2025-04-13 17:08:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115235 to 50483. [2025-04-13 17:08:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50483 states, 50479 states have (on average 2.9868658253927376) internal successors, (150774), 50482 states have internal predecessors, (150774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50483 states to 50483 states and 150774 transitions. [2025-04-13 17:08:04,082 INFO L79 Accepts]: Start accepts. Automaton has 50483 states and 150774 transitions. Word has length 67 [2025-04-13 17:08:04,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:08:04,082 INFO L485 AbstractCegarLoop]: Abstraction has 50483 states and 150774 transitions. [2025-04-13 17:08:04,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:04,082 INFO L278 IsEmpty]: Start isEmpty. Operand 50483 states and 150774 transitions. [2025-04-13 17:08:04,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-13 17:08:04,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:08:04,090 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:08:04,098 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 17:08:04,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:04,290 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:08:04,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:08:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash 976424600, now seen corresponding path program 5 times [2025-04-13 17:08:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:08:04,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850613275] [2025-04-13 17:08:04,291 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:08:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:08:04,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 13 equivalence classes. [2025-04-13 17:08:04,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:08:04,369 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 17:08:04,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:08:05,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850613275] [2025-04-13 17:08:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850613275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:08:05,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215675552] [2025-04-13 17:08:05,792 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:08:05,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:08:05,795 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 17:08:05,796 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 17:08:05,998 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 13 equivalence classes. [2025-04-13 17:08:06,590 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:08:06,591 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 17:08:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:06,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:08:06,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:08:06,612 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 8 treesize of output 1 [2025-04-13 17:08:06,629 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 8 treesize of output 1 [2025-04-13 17:08:06,644 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 8 treesize of output 1 [2025-04-13 17:08:06,663 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 8 treesize of output 1 [2025-04-13 17:08:06,687 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 8 treesize of output 1 [2025-04-13 17:08:06,712 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 8 treesize of output 1 [2025-04-13 17:08:06,738 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 8 treesize of output 1 [2025-04-13 17:08:06,762 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 8 treesize of output 1 [2025-04-13 17:08:06,789 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 8 treesize of output 1 [2025-04-13 17:08:06,812 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 8 treesize of output 1 [2025-04-13 17:08:06,833 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 8 treesize of output 1 [2025-04-13 17:08:06,855 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 8 treesize of output 1 [2025-04-13 17:08:07,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 41 [2025-04-13 17:08:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:07,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:08:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 105 proven. 38 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-04-13 17:08:07,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215675552] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:08:07,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:08:07,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 9] total 40 [2025-04-13 17:08:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737034516] [2025-04-13 17:08:07,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:08:07,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 17:08:07,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:08:07,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 17:08:07,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1254, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:08:07,598 INFO L87 Difference]: Start difference. First operand 50483 states and 150774 transitions. Second operand has 41 states, 40 states have (on average 4.575) internal successors, (183), 41 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:08:10,177 INFO L93 Difference]: Finished difference Result 126597 states and 370023 transitions. [2025-04-13 17:08:10,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:08:10,177 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.575) internal successors, (183), 41 states have internal predecessors, (183), 0 states have call successors, (0), 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 75 [2025-04-13 17:08:10,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:08:10,578 INFO L225 Difference]: With dead ends: 126597 [2025-04-13 17:08:10,578 INFO L226 Difference]: Without dead ends: 126416 [2025-04-13 17:08:10,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=917, Invalid=1945, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:08:10,632 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 950 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5269 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 5269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:08:10,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 0 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 5269 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 17:08:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126416 states. [2025-04-13 17:08:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126416 to 48049. [2025-04-13 17:08:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48049 states, 48045 states have (on average 2.9787699032157353) internal successors, (143115), 48048 states have internal predecessors, (143115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48049 states to 48049 states and 143115 transitions. [2025-04-13 17:08:12,476 INFO L79 Accepts]: Start accepts. Automaton has 48049 states and 143115 transitions. Word has length 75 [2025-04-13 17:08:12,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:08:12,476 INFO L485 AbstractCegarLoop]: Abstraction has 48049 states and 143115 transitions. [2025-04-13 17:08:12,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.575) internal successors, (183), 41 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:12,476 INFO L278 IsEmpty]: Start isEmpty. Operand 48049 states and 143115 transitions. [2025-04-13 17:08:12,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-13 17:08:12,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:08:12,483 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:08:12,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 17:08:12,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:12,683 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:08:12,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:08:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1706191724, now seen corresponding path program 8 times [2025-04-13 17:08:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:08:12,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050885537] [2025-04-13 17:08:12,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:08:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:08:12,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-04-13 17:08:12,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:08:12,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:08:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:08:15,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050885537] [2025-04-13 17:08:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050885537] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:08:15,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537338767] [2025-04-13 17:08:15,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:08:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:08:15,515 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 17:08:15,516 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 17:08:15,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-04-13 17:08:15,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:08:15,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:08:15,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:08:15,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:08:15,872 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 17:08:15,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:15,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:15,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:15,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:16,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:16,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:16,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:16,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:08:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:17,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:08:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 16 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537338767] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:08:20,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:08:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 44 [2025-04-13 17:08:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618814730] [2025-04-13 17:08:20,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:08:20,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 17:08:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:08:20,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 17:08:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1611, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:08:20,212 INFO L87 Difference]: Start difference. First operand 48049 states and 143115 transitions. Second operand has 45 states, 44 states have (on average 4.818181818181818) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:08:26,054 INFO L93 Difference]: Finished difference Result 65425 states and 190612 transitions. [2025-04-13 17:08:26,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:08:26,055 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.818181818181818) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 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 75 [2025-04-13 17:08:26,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:08:26,299 INFO L225 Difference]: With dead ends: 65425 [2025-04-13 17:08:26,299 INFO L226 Difference]: Without dead ends: 64657 [2025-04-13 17:08:26,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1556, Invalid=5250, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:08:26,330 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:08:26,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 0 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 17:08:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64657 states. [2025-04-13 17:08:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64657 to 45191. [2025-04-13 17:08:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45191 states, 45187 states have (on average 2.976165711377166) internal successors, (134484), 45190 states have internal predecessors, (134484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45191 states to 45191 states and 134484 transitions. [2025-04-13 17:08:27,719 INFO L79 Accepts]: Start accepts. Automaton has 45191 states and 134484 transitions. Word has length 75 [2025-04-13 17:08:27,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:08:27,719 INFO L485 AbstractCegarLoop]: Abstraction has 45191 states and 134484 transitions. [2025-04-13 17:08:27,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.818181818181818) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:27,720 INFO L278 IsEmpty]: Start isEmpty. Operand 45191 states and 134484 transitions. [2025-04-13 17:08:27,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-13 17:08:27,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:08:27,728 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:08:27,738 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 17:08:27,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:27,928 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:08:27,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:08:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2117187039, now seen corresponding path program 6 times [2025-04-13 17:08:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:08:27,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273528384] [2025-04-13 17:08:27,931 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:08:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:08:27,955 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 14 equivalence classes. [2025-04-13 17:08:28,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 43 of 79 statements. [2025-04-13 17:08:28,095 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:08:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 37 proven. 22 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-04-13 17:08:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:08:28,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273528384] [2025-04-13 17:08:28,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273528384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:08:28,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019741039] [2025-04-13 17:08:28,690 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:08:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:08:28,692 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 17:08:28,692 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 17:08:28,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 14 equivalence classes. [2025-04-13 17:08:29,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 43 of 79 statements. [2025-04-13 17:08:29,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:08:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:29,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 17:08:29,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:08:29,115 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 8 treesize of output 1 [2025-04-13 17:08:30,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 261 treesize of output 222 [2025-04-13 17:08:31,021 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:08:31,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 222 treesize of output 925 [2025-04-13 17:10:00,293 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 8 treesize of output 1 [2025-04-13 17:10:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 37 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-04-13 17:10:00,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:10:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 39 proven. 22 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-04-13 17:10:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019741039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:10:00,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:10:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2025-04-13 17:10:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545911703] [2025-04-13 17:10:00,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:10:00,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:10:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:10:00,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:10:00,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:10:00,528 INFO L87 Difference]: Start difference. First operand 45191 states and 134484 transitions. Second operand has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:10:02,410 INFO L93 Difference]: Finished difference Result 121216 states and 337320 transitions. [2025-04-13 17:10:02,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:10:02,411 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 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 79 [2025-04-13 17:10:02,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:10:02,788 INFO L225 Difference]: With dead ends: 121216 [2025-04-13 17:10:02,788 INFO L226 Difference]: Without dead ends: 121210 [2025-04-13 17:10:02,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:10:02,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:10:02,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:10:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121210 states. [2025-04-13 17:10:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121210 to 66625. [2025-04-13 17:10:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66625 states, 66621 states have (on average 2.9749928701160293) internal successors, (198197), 66624 states have internal predecessors, (198197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66625 states to 66625 states and 198197 transitions. [2025-04-13 17:10:05,227 INFO L79 Accepts]: Start accepts. Automaton has 66625 states and 198197 transitions. Word has length 79 [2025-04-13 17:10:05,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:10:05,228 INFO L485 AbstractCegarLoop]: Abstraction has 66625 states and 198197 transitions. [2025-04-13 17:10:05,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:05,228 INFO L278 IsEmpty]: Start isEmpty. Operand 66625 states and 198197 transitions. [2025-04-13 17:10:05,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-04-13 17:10:05,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:10:05,239 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:10:05,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 17:10:05,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:05,440 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:10:05,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:10:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1390351762, now seen corresponding path program 7 times [2025-04-13 17:10:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:10:05,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543803180] [2025-04-13 17:10:05,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:10:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:10:05,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-13 17:10:05,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-13 17:10:05,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:10:05,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 17:10:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:10:06,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543803180] [2025-04-13 17:10:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543803180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:10:06,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809296091] [2025-04-13 17:10:06,972 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:10:06,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:10:06,974 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 17:10:06,974 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 17:10:07,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-13 17:10:07,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-13 17:10:07,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:10:07,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:07,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:10:07,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:10:07,349 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 8 treesize of output 1 [2025-04-13 17:10:07,369 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 8 treesize of output 1 [2025-04-13 17:10:07,387 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 8 treesize of output 1 [2025-04-13 17:10:07,408 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 8 treesize of output 1 [2025-04-13 17:10:07,428 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 8 treesize of output 1 [2025-04-13 17:10:07,448 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 8 treesize of output 1 [2025-04-13 17:10:07,469 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 8 treesize of output 1 [2025-04-13 17:10:07,491 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 8 treesize of output 1 [2025-04-13 17:10:07,514 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 8 treesize of output 1 [2025-04-13 17:10:07,540 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 8 treesize of output 1 [2025-04-13 17:10:07,563 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 8 treesize of output 1 [2025-04-13 17:10:07,588 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 8 treesize of output 1 [2025-04-13 17:10:07,610 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 8 treesize of output 1 [2025-04-13 17:10:07,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 32 [2025-04-13 17:10:07,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:10:07,909 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 32 treesize of output 20 [2025-04-13 17:10:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:08,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:10:08,461 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:10:08,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 16 [2025-04-13 17:10:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 142 proven. 66 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-04-13 17:10:08,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809296091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:10:08,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:10:08,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 10] total 44 [2025-04-13 17:10:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411980899] [2025-04-13 17:10:08,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:10:08,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 17:10:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:10:08,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 17:10:08,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1542, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:10:08,618 INFO L87 Difference]: Start difference. First operand 66625 states and 198197 transitions. Second operand has 45 states, 44 states have (on average 4.568181818181818) internal successors, (201), 45 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:10:11,643 INFO L93 Difference]: Finished difference Result 201847 states and 593061 transitions. [2025-04-13 17:10:11,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:10:11,643 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.568181818181818) internal successors, (201), 45 states have internal predecessors, (201), 0 states have call successors, (0), 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 83 [2025-04-13 17:10:11,644 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:10:12,880 INFO L225 Difference]: With dead ends: 201847 [2025-04-13 17:10:12,881 INFO L226 Difference]: Without dead ends: 201645 [2025-04-13 17:10:12,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=747, Invalid=1905, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:10:12,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 887 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7205 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 7205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:10:12,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 0 Invalid, 7331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 7205 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 17:10:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201645 states. [2025-04-13 17:10:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201645 to 102065. [2025-04-13 17:10:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102065 states, 102061 states have (on average 2.979992357511684) internal successors, (304141), 102064 states have internal predecessors, (304141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102065 states to 102065 states and 304141 transitions. [2025-04-13 17:10:16,754 INFO L79 Accepts]: Start accepts. Automaton has 102065 states and 304141 transitions. Word has length 83 [2025-04-13 17:10:16,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:10:16,754 INFO L485 AbstractCegarLoop]: Abstraction has 102065 states and 304141 transitions. [2025-04-13 17:10:16,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.568181818181818) internal successors, (201), 45 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:16,754 INFO L278 IsEmpty]: Start isEmpty. Operand 102065 states and 304141 transitions. [2025-04-13 17:10:16,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-04-13 17:10:16,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:10:16,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:10:16,774 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 17:10:16,966 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,SelfDestructingSolverStorable22 [2025-04-13 17:10:16,966 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:10:16,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:10:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -413832526, now seen corresponding path program 9 times [2025-04-13 17:10:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:10:16,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373653545] [2025-04-13 17:10:16,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:10:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:10:16,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 10 equivalence classes. [2025-04-13 17:10:17,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 83 of 83 statements. [2025-04-13 17:10:17,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-04-13 17:10:17,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:10:20,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373653545] [2025-04-13 17:10:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373653545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:10:20,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090389468] [2025-04-13 17:10:20,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:10:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:10:20,959 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 17:10:20,960 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 17:10:21,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 10 equivalence classes. [2025-04-13 17:10:22,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 83 of 83 statements. [2025-04-13 17:10:22,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-04-13 17:10:22,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:22,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:10:22,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:10:22,573 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 17:10:22,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:22,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 17:10:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:24,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:10:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 18 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:28,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090389468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:10:28,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:10:28,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 20] total 55 [2025-04-13 17:10:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461967369] [2025-04-13 17:10:28,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:10:28,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 17:10:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:10:28,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 17:10:28,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 17:10:28,025 INFO L87 Difference]: Start difference. First operand 102065 states and 304141 transitions. Second operand has 56 states, 55 states have (on average 4.454545454545454) internal successors, (245), 56 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:10:36,604 INFO L93 Difference]: Finished difference Result 130268 states and 381573 transitions. [2025-04-13 17:10:36,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 17:10:36,605 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 4.454545454545454) internal successors, (245), 56 states have internal predecessors, (245), 0 states have call successors, (0), 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 83 [2025-04-13 17:10:36,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:10:37,006 INFO L225 Difference]: With dead ends: 130268 [2025-04-13 17:10:37,007 INFO L226 Difference]: Without dead ends: 129401 [2025-04-13 17:10:37,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3412 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2246, Invalid=8260, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 17:10:37,062 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1732 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6713 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 6713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:10:37,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 0 Invalid, 6895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 6713 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:10:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129401 states. [2025-04-13 17:10:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129401 to 93795. [2025-04-13 17:10:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93795 states, 93791 states have (on average 2.9730144683391795) internal successors, (278842), 93794 states have internal predecessors, (278842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93795 states to 93795 states and 278842 transitions. [2025-04-13 17:10:40,725 INFO L79 Accepts]: Start accepts. Automaton has 93795 states and 278842 transitions. Word has length 83 [2025-04-13 17:10:40,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:10:40,725 INFO L485 AbstractCegarLoop]: Abstraction has 93795 states and 278842 transitions. [2025-04-13 17:10:40,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.454545454545454) internal successors, (245), 56 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:40,725 INFO L278 IsEmpty]: Start isEmpty. Operand 93795 states and 278842 transitions. [2025-04-13 17:10:40,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-04-13 17:10:40,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:10:40,738 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:10:40,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 17:10:40,939 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,SelfDestructingSolverStorable23 [2025-04-13 17:10:40,939 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:10:40,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:10:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 55770907, now seen corresponding path program 8 times [2025-04-13 17:10:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:10:40,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225445485] [2025-04-13 17:10:40,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:10:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:10:40,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-04-13 17:10:40,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-13 17:10:40,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:10:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:42,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:10:42,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225445485] [2025-04-13 17:10:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225445485] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:10:42,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118880114] [2025-04-13 17:10:42,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:10:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:10:42,455 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 17:10:42,456 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 17:10:42,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-04-13 17:10:42,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-13 17:10:42,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:10:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:42,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:10:42,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:10:42,871 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 8 treesize of output 1 [2025-04-13 17:10:42,889 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 8 treesize of output 1 [2025-04-13 17:10:42,905 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 8 treesize of output 1 [2025-04-13 17:10:42,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 8 treesize of output 1 [2025-04-13 17:10:42,941 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 8 treesize of output 1 [2025-04-13 17:10:42,958 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 8 treesize of output 1 [2025-04-13 17:10:42,978 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 8 treesize of output 1 [2025-04-13 17:10:42,997 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 8 treesize of output 1 [2025-04-13 17:10:43,016 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 8 treesize of output 1 [2025-04-13 17:10:43,036 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 8 treesize of output 1 [2025-04-13 17:10:43,056 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 8 treesize of output 1 [2025-04-13 17:10:43,077 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 8 treesize of output 1 [2025-04-13 17:10:43,097 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 8 treesize of output 1 [2025-04-13 17:10:43,118 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 8 treesize of output 1 [2025-04-13 17:10:43,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 69 treesize of output 51 [2025-04-13 17:10:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:10:43,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:10:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 158 proven. 66 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-04-13 17:10:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118880114] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:10:44,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:10:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 11] total 47 [2025-04-13 17:10:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261443651] [2025-04-13 17:10:44,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:10:44,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 17:10:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:10:44,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 17:10:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=1736, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:10:44,216 INFO L87 Difference]: Start difference. First operand 93795 states and 278842 transitions. Second operand has 48 states, 47 states have (on average 4.574468085106383) internal successors, (215), 48 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:10:47,983 INFO L93 Difference]: Finished difference Result 277939 states and 816125 transitions. [2025-04-13 17:10:47,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 17:10:47,984 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.574468085106383) internal successors, (215), 48 states have internal predecessors, (215), 0 states have call successors, (0), 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 87 [2025-04-13 17:10:47,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:10:49,776 INFO L225 Difference]: With dead ends: 277939 [2025-04-13 17:10:49,776 INFO L226 Difference]: Without dead ends: 277716 [2025-04-13 17:10:49,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:10:49,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1339 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6270 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 6270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:10:49,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 0 Invalid, 6421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 6270 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 17:10:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277716 states. [2025-04-13 17:10:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277716 to 88293. [2025-04-13 17:10:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88293 states, 88289 states have (on average 2.975421626703213) internal successors, (262697), 88292 states have internal predecessors, (262697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88293 states to 88293 states and 262697 transitions. [2025-04-13 17:10:54,251 INFO L79 Accepts]: Start accepts. Automaton has 88293 states and 262697 transitions. Word has length 87 [2025-04-13 17:10:54,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:10:54,253 INFO L485 AbstractCegarLoop]: Abstraction has 88293 states and 262697 transitions. [2025-04-13 17:10:54,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.574468085106383) internal successors, (215), 48 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:10:54,253 INFO L278 IsEmpty]: Start isEmpty. Operand 88293 states and 262697 transitions. [2025-04-13 17:10:54,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-04-13 17:10:54,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:10:54,271 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:10:54,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 17:10:54,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:54,471 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:10:54,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:10:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash -377717212, now seen corresponding path program 9 times [2025-04-13 17:10:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:10:54,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429044207] [2025-04-13 17:10:54,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:10:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:10:54,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 16 equivalence classes. [2025-04-13 17:10:54,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 91 statements. [2025-04-13 17:10:54,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:10:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-04-13 17:10:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:10:55,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429044207] [2025-04-13 17:10:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429044207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:10:55,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14424790] [2025-04-13 17:10:55,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:10:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:10:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:10:55,489 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 17:10:55,489 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 17:10:55,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 16 equivalence classes. [2025-04-13 17:10:55,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 91 statements. [2025-04-13 17:10:55,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:10:55,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:10:55,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:10:55,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:10:55,971 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 8 treesize of output 1 [2025-04-13 17:10:56,003 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 8 treesize of output 1 [2025-04-13 17:10:58,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 375 treesize of output 322 [2025-04-13 17:11:00,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:11:00,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 322 treesize of output 2266 [2025-04-13 17:12:46,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 17:12:46,981 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 17:12:46,982 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 17:12:46,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 17:12:47,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:12:47,185 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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) ... 77 more [2025-04-13 17:12:47,189 INFO L158 Benchmark]: Toolchain (without parser) took 391294.19ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 96.2MB in the beginning and 399.0MB in the end (delta: -302.7MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-13 17:12:47,189 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:12:47,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.09ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 59.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 17:12:47,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.59ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 53.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 17:12:47,189 INFO L158 Benchmark]: Boogie Preprocessor took 68.94ms. Allocated memory is still 142.6MB. Free memory was 53.2MB in the beginning and 48.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:12:47,190 INFO L158 Benchmark]: RCFGBuilder took 3965.84ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 48.3MB in the beginning and 492.9MB in the end (delta: -444.6MB). Peak memory consumption was 580.1MB. Max. memory is 8.0GB. [2025-04-13 17:12:47,190 INFO L158 Benchmark]: TraceAbstraction took 386630.91ms. Allocated memory was 1.2GB in the beginning and 1.3GB in the end (delta: 121.6MB). Free memory was 490.8MB in the beginning and 399.0MB in the end (delta: 91.8MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 17:12:47,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.09ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 59.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.59ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 53.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.94ms. Allocated memory is still 142.6MB. Free memory was 53.2MB in the beginning and 48.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 3965.84ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 48.3MB in the beginning and 492.9MB in the end (delta: -444.6MB). Peak memory consumption was 580.1MB. Max. memory is 8.0GB. * TraceAbstraction took 386630.91ms. Allocated memory was 1.2GB in the beginning and 1.3GB in the end (delta: 121.6MB). Free memory was 490.8MB in the beginning and 399.0MB in the end (delta: 91.8MB). Peak memory consumption was 1.6GB. 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...