./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/EvenOdd01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/EvenOdd01-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 90982c548a5fc18702a6b533ab589c969b87a7efde724f265c9d2a7d593347dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:55:07,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:55:07,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:55:07,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:55:07,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:55:07,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:55:07,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:55:07,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:55:07,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:55:07,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:55:07,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:55:07,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:55:07,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:55:07,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:55:07,532 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:55:07,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:55:07,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:55:07,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:55:07,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:55:07,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:55:07,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:07,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:55:07,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:55:07,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:55:07,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:55:07,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90982c548a5fc18702a6b533ab589c969b87a7efde724f265c9d2a7d593347dc [2025-02-05 15:55:07,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:55:07,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:55:07,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:55:07,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:55:07,841 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:55:07,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/EvenOdd01-1.c [2025-02-05 15:55:09,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/495aa7f83/2c37859e021f4baeb02c3be186cd34b7/FLAGb134c4992 [2025-02-05 15:55:09,466 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:55:09,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd01-1.c [2025-02-05 15:55:09,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/495aa7f83/2c37859e021f4baeb02c3be186cd34b7/FLAGb134c4992 [2025-02-05 15:55:09,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/495aa7f83/2c37859e021f4baeb02c3be186cd34b7 [2025-02-05 15:55:09,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:55:09,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:55:09,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:09,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:55:09,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:55:09,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ffed53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09, skipping insertion in model container [2025-02-05 15:55:09,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:55:09,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd01-1.c[975,988] [2025-02-05 15:55:09,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:09,678 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:55:09,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd01-1.c[975,988] [2025-02-05 15:55:09,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:09,707 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:55:09,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09 WrapperNode [2025-02-05 15:55:09,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:09,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:09,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:55:09,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:55:09,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,734 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2025-02-05 15:55:09,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:09,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:55:09,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:55:09,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:55:09,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,765 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:55:09,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:55:09,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:55:09,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:55:09,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:55:09,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (1/1) ... [2025-02-05 15:55:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:09,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:09,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:55:09,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2025-02-05 15:55:09,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2025-02-05 15:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2025-02-05 15:55:09,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2025-02-05 15:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:55:09,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:55:09,893 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:55:09,895 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:55:09,963 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc #t~ret5; [2025-02-05 15:55:09,990 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2025-02-05 15:55:10,060 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 15:55:10,061 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:55:10,071 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:55:10,071 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:55:10,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:10 BoogieIcfgContainer [2025-02-05 15:55:10,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:55:10,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:55:10,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:55:10,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:55:10,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:55:09" (1/3) ... [2025-02-05 15:55:10,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37395fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:10, skipping insertion in model container [2025-02-05 15:55:10,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:09" (2/3) ... [2025-02-05 15:55:10,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37395fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:10, skipping insertion in model container [2025-02-05 15:55:10,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:10" (3/3) ... [2025-02-05 15:55:10,083 INFO L128 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2025-02-05 15:55:10,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:55:10,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG EvenOdd01-1.c that has 3 procedures, 25 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:55:10,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:55:10,168 INFO L333 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=PETRI_NET, 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;@5b8fda07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:55:10,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:55:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:55:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 15:55:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:10,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:10,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1488382946, now seen corresponding path program 1 times [2025-02-05 15:55:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894725117] [2025-02-05 15:55:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:10,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:10,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 15:55:10,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 15:55:10,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:10,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894725117] [2025-02-05 15:55:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894725117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:10,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:55:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140153998] [2025-02-05 15:55:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:10,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:10,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:10,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:10,795 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:10,914 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-02-05 15:55:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-05 15:55:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:10,923 INFO L225 Difference]: With dead ends: 36 [2025-02-05 15:55:10,926 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:55:10,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:10,933 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:55:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-05 15:55:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:55:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-05 15:55:10,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2025-02-05 15:55:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:10,965 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-05 15:55:10,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-05 15:55:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 15:55:10,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:10,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:55:10,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -293200320, now seen corresponding path program 1 times [2025-02-05 15:55:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035478207] [2025-02-05 15:55:10,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:10,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 15:55:10,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 15:55:10,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:10,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:11,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035478207] [2025-02-05 15:55:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035478207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:55:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800735827] [2025-02-05 15:55:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:11,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:11,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:11,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:11,314 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:11,392 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-05 15:55:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-05 15:55:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:11,393 INFO L225 Difference]: With dead ends: 30 [2025-02-05 15:55:11,394 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:55:11,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:11,395 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:11,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:55:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-05 15:55:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:55:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-05 15:55:11,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2025-02-05 15:55:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:11,406 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-05 15:55:11,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-05 15:55:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:55:11,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:11,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:11,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:55:11,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash -797868090, now seen corresponding path program 1 times [2025-02-05 15:55:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956511231] [2025-02-05 15:55:11,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:11,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:55:11,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:55:11,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:11,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956511231] [2025-02-05 15:55:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956511231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492586817] [2025-02-05 15:55:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:11,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:11,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:11,507 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:11,536 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-02-05 15:55:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:55:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:11,537 INFO L225 Difference]: With dead ends: 38 [2025-02-05 15:55:11,537 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:55:11,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:11,538 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:11,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:55:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-05 15:55:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:55:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-05 15:55:11,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2025-02-05 15:55:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:11,549 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-05 15:55:11,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-05 15:55:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:55:11,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:11,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:55:11,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:11,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1410627175, now seen corresponding path program 1 times [2025-02-05 15:55:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744818239] [2025-02-05 15:55:11,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:11,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:55:11,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:55:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744818239] [2025-02-05 15:55:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744818239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:55:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656170320] [2025-02-05 15:55:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:55:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:11,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:55:11,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:55:11,836 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:11,967 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-02-05 15:55:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:55:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-05 15:55:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:11,969 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:55:11,969 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 15:55:11,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:55:11,970 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:11,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 15:55:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 15:55:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:55:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-02-05 15:55:11,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2025-02-05 15:55:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:11,980 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-02-05 15:55:11,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-02-05 15:55:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:55:11,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:11,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:55:11,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:11,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 547077751, now seen corresponding path program 1 times [2025-02-05 15:55:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744772071] [2025-02-05 15:55:11,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:55:11,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:55:11,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:11,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744772071] [2025-02-05 15:55:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744772071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206583051] [2025-02-05 15:55:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:12,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:12,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:12,043 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:12,074 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-02-05 15:55:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-02-05 15:55:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:12,075 INFO L225 Difference]: With dead ends: 41 [2025-02-05 15:55:12,075 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 15:55:12,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:12,076 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:12,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 15:55:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 15:55:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:55:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-02-05 15:55:12,086 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2025-02-05 15:55:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:12,086 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-05 15:55:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-02-05 15:55:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:55:12,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:12,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:55:12,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2090856625, now seen corresponding path program 1 times [2025-02-05 15:55:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133963080] [2025-02-05 15:55:12,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:55:12,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:55:12,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:12,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:55:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133963080] [2025-02-05 15:55:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133963080] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668756207] [2025-02-05 15:55:12,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:12,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:12,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:12,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:55:12,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:55:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:55:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:12,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 15:55:12,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:55:12,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668756207] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:13,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-02-05 15:55:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686807300] [2025-02-05 15:55:13,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 15:55:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:13,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 15:55:13,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:55:13,231 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:55:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:13,430 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-02-05 15:55:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:55:13,430 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 26 [2025-02-05 15:55:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:13,431 INFO L225 Difference]: With dead ends: 39 [2025-02-05 15:55:13,431 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 15:55:13,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:55:13,432 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:13,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 178 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 15:55:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-02-05 15:55:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:55:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-02-05 15:55:13,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2025-02-05 15:55:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:13,446 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-02-05 15:55:13,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:55:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-02-05 15:55:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:55:13,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:13,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:13,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:13,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:13,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -361196562, now seen corresponding path program 1 times [2025-02-05 15:55:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440893938] [2025-02-05 15:55:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:13,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:55:13,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:55:13,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:13,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440893938] [2025-02-05 15:55:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440893938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870383907] [2025-02-05 15:55:13,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:13,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:13,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:13,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:55:14,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:55:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:55:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:14,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 15:55:14,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:14,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:55:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870383907] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:15,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 36 [2025-02-05 15:55:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369917923] [2025-02-05 15:55:15,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:15,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 15:55:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:15,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 15:55:15,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 15:55:15,397 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 12 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-05 15:55:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:15,825 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-02-05 15:55:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:55:15,826 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 12 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) Word has length 33 [2025-02-05 15:55:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:15,826 INFO L225 Difference]: With dead ends: 45 [2025-02-05 15:55:15,827 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 15:55:15,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 15:55:15,828 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:15,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 325 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 15:55:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-02-05 15:55:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:55:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-05 15:55:15,840 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 33 [2025-02-05 15:55:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:15,840 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-05 15:55:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 12 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-05 15:55:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-05 15:55:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 15:55:15,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:15,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:15,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:16,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:16,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash -114440610, now seen corresponding path program 2 times [2025-02-05 15:55:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:16,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818044433] [2025-02-05 15:55:16,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:16,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-05 15:55:16,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:55:16,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:55:16,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818044433] [2025-02-05 15:55:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818044433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213742722] [2025-02-05 15:55:16,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:16,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:16,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:55:16,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-05 15:55:16,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:55:16,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:16,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:16,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 15:55:16,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:55:16,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:55:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213742722] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:17,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 27 [2025-02-05 15:55:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021312339] [2025-02-05 15:55:17,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 15:55:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:17,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 15:55:17,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:55:17,292 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 19 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 15:55:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:17,618 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-02-05 15:55:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:55:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 19 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 40 [2025-02-05 15:55:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:17,620 INFO L225 Difference]: With dead ends: 51 [2025-02-05 15:55:17,620 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 15:55:17,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 15:55:17,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:17,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 253 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 15:55:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2025-02-05 15:55:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:55:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-05 15:55:17,630 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 40 [2025-02-05 15:55:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-05 15:55:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 19 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 15:55:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-05 15:55:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 15:55:17,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:17,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:17,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:17,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -431270589, now seen corresponding path program 2 times [2025-02-05 15:55:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:17,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511761985] [2025-02-05 15:55:17,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:17,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-05 15:55:17,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 15:55:17,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:55:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511761985] [2025-02-05 15:55:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511761985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489072133] [2025-02-05 15:55:18,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:18,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:18,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:18,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:18,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:55:18,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-05 15:55:18,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 15:55:18,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:18,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:18,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-05 15:55:18,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:55:18,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:55:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489072133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:20,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 21] total 50 [2025-02-05 15:55:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314821817] [2025-02-05 15:55:20,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:20,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-05 15:55:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:20,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-05 15:55:20,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 15:55:20,398 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 32 states have internal predecessors, (70), 9 states have call successors, (9), 1 states have call predecessors, (9), 18 states have return successors, (18), 18 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-05 15:55:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:21,046 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2025-02-05 15:55:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 15:55:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 32 states have internal predecessors, (70), 9 states have call successors, (9), 1 states have call predecessors, (9), 18 states have return successors, (18), 18 states have call predecessors, (18), 9 states have call successors, (18) Word has length 47 [2025-02-05 15:55:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:21,047 INFO L225 Difference]: With dead ends: 57 [2025-02-05 15:55:21,047 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 15:55:21,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=3494, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 15:55:21,049 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:21,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 505 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:55:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 15:55:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2025-02-05 15:55:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:55:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-02-05 15:55:21,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 47 [2025-02-05 15:55:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:21,055 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-02-05 15:55:21,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 32 states have internal predecessors, (70), 9 states have call successors, (9), 1 states have call predecessors, (9), 18 states have return successors, (18), 18 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-05 15:55:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-02-05 15:55:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 15:55:21,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:21,056 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:21,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:55:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 15:55:21,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1283625837, now seen corresponding path program 3 times [2025-02-05 15:55:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106323311] [2025-02-05 15:55:21,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:21,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 4 equivalence classes. [2025-02-05 15:55:21,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 15:55:21,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:55:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106323311] [2025-02-05 15:55:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106323311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689948365] [2025-02-05 15:55:21,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:21,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:21,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:55:21,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 4 equivalence classes. [2025-02-05 15:55:21,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 15:55:21,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:21,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:21,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-05 15:55:21,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:55:21,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:55:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689948365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:22,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 24] total 33 [2025-02-05 15:55:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038392409] [2025-02-05 15:55:22,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 15:55:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:22,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 15:55:22,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:55:22,945 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 33 states, 32 states have (on average 1.75) internal successors, (56), 23 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-05 15:55:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:23,313 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-02-05 15:55:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 15:55:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 23 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 54 [2025-02-05 15:55:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:23,315 INFO L225 Difference]: With dead ends: 63 [2025-02-05 15:55:23,315 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 15:55:23,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1773, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 15:55:23,316 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:23,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 348 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 15:55:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2025-02-05 15:55:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:55:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-02-05 15:55:23,323 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 54 [2025-02-05 15:55:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-02-05 15:55:23,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 23 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-05 15:55:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-02-05 15:55:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 15:55:23,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:23,326 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:23,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:55:23,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:55:23,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:23,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash -426459752, now seen corresponding path program 3 times [2025-02-05 15:55:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395762526] [2025-02-05 15:55:23,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:23,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 4 equivalence classes. [2025-02-05 15:55:23,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 15:55:23,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:23,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 15:55:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395762526] [2025-02-05 15:55:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395762526] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985159116] [2025-02-05 15:55:24,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:24,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:24,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:55:24,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 4 equivalence classes. [2025-02-05 15:55:24,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 15:55:24,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:24,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:24,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-05 15:55:24,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:55:24,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:55:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985159116] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:27,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 27] total 65 [2025-02-05 15:55:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220472476] [2025-02-05 15:55:27,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-05 15:55:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:27,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-05 15:55:27,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 15:55:27,433 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 41 states have internal predecessors, (90), 11 states have call successors, (11), 1 states have call predecessors, (11), 24 states have return successors, (24), 24 states have call predecessors, (24), 11 states have call successors, (24) [2025-02-05 15:55:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,266 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-02-05 15:55:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:55:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.40625) internal successors, (90), 41 states have internal predecessors, (90), 11 states have call successors, (11), 1 states have call predecessors, (11), 24 states have return successors, (24), 24 states have call predecessors, (24), 11 states have call successors, (24) Word has length 61 [2025-02-05 15:55:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,267 INFO L225 Difference]: With dead ends: 69 [2025-02-05 15:55:28,267 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 15:55:28,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=413, Invalid=6067, Unknown=0, NotChecked=0, Total=6480 [2025-02-05 15:55:28,270 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 578 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:55:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 15:55:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2025-02-05 15:55:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:55:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-02-05 15:55:28,287 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 61 [2025-02-05 15:55:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,287 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-02-05 15:55:28,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.40625) internal successors, (90), 41 states have internal predecessors, (90), 11 states have call successors, (11), 1 states have call predecessors, (11), 24 states have return successors, (24), 24 states have call predecessors, (24), 11 states have call successors, (24) [2025-02-05 15:55:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-02-05 15:55:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:55:28,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:28,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:55:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:55:28,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1907767684, now seen corresponding path program 4 times [2025-02-05 15:55:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279732531] [2025-02-05 15:55:28,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-02-05 15:55:28,499 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:55:28,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:28,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:55:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279732531] [2025-02-05 15:55:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279732531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390938147] [2025-02-05 15:55:29,245 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:29,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:29,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:55:29,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-02-05 15:55:29,330 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:55:29,330 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:29,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-05 15:55:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:55:29,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:55:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390938147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:30,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 30] total 37 [2025-02-05 15:55:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637074818] [2025-02-05 15:55:30,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 15:55:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 15:55:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 15:55:30,998 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 26 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-05 15:55:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,542 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-02-05 15:55:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 15:55:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 26 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Word has length 68 [2025-02-05 15:55:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,543 INFO L225 Difference]: With dead ends: 75 [2025-02-05 15:55:31,543 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:55:31,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=2496, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 15:55:31,544 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 410 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:55:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:55:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2025-02-05 15:55:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:55:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-02-05 15:55:31,553 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 68 [2025-02-05 15:55:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-02-05 15:55:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 26 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-05 15:55:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-02-05 15:55:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:55:31,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,554 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:31,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:55:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:31,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -880952083, now seen corresponding path program 4 times [2025-02-05 15:55:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010659535] [2025-02-05 15:55:31,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,760 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-02-05 15:55:31,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:55:31,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 15:55:32,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010659535] [2025-02-05 15:55:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010659535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833673940] [2025-02-05 15:55:32,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:32,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:32,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:32,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:32,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:55:32,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-02-05 15:55:32,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:55:32,510 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:32,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:32,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-05 15:55:32,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 15:55:33,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:55:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833673940] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:35,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:35,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 33] total 61 [2025-02-05 15:55:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516120268] [2025-02-05 15:55:35,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:35,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-05 15:55:35,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:35,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-05 15:55:35,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3441, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 15:55:35,032 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 61 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 39 states have internal predecessors, (89), 13 states have call successors, (13), 1 states have call predecessors, (13), 21 states have return successors, (30), 22 states have call predecessors, (30), 13 states have call successors, (30) [2025-02-05 15:55:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:35,782 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2025-02-05 15:55:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 15:55:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 39 states have internal predecessors, (89), 13 states have call successors, (13), 1 states have call predecessors, (13), 21 states have return successors, (30), 22 states have call predecessors, (30), 13 states have call successors, (30) Word has length 75 [2025-02-05 15:55:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:35,783 INFO L225 Difference]: With dead ends: 81 [2025-02-05 15:55:35,783 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 15:55:35,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=409, Invalid=5753, Unknown=0, NotChecked=0, Total=6162 [2025-02-05 15:55:35,786 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:35,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 576 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:55:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 15:55:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 51. [2025-02-05 15:55:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:55:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-02-05 15:55:35,794 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 75 [2025-02-05 15:55:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:35,794 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-05 15:55:35,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 39 states have internal predecessors, (89), 13 states have call successors, (13), 1 states have call predecessors, (13), 21 states have return successors, (30), 22 states have call predecessors, (30), 13 states have call successors, (30) [2025-02-05 15:55:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-02-05 15:55:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:55:35,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:35,795 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:55:35,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:35,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:35,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1899581557, now seen corresponding path program 5 times [2025-02-05 15:55:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995984145] [2025-02-05 15:55:35,997 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:36,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 6 equivalence classes. [2025-02-05 15:55:36,012 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:55:36,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 15:55:36,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:55:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995984145] [2025-02-05 15:55:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995984145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492511449] [2025-02-05 15:55:36,830 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:36,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:36,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:36,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:55:36,930 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 6 equivalence classes. [2025-02-05 15:55:36,953 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:55:36,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 15:55:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:36,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-05 15:55:36,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:55:37,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:55:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492511449] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:39,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 36] total 43 [2025-02-05 15:55:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476184062] [2025-02-05 15:55:39,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:39,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 15:55:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:39,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 15:55:39,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1668, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 15:55:39,144 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 30 states have internal predecessors, (73), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 13 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-05 15:55:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:39,831 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2025-02-05 15:55:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 15:55:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 30 states have internal predecessors, (73), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 13 states have call predecessors, (22), 14 states have call successors, (22) Word has length 82 [2025-02-05 15:55:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:39,832 INFO L225 Difference]: With dead ends: 87 [2025-02-05 15:55:39,832 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 15:55:39,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 147 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=3568, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 15:55:39,834 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:39,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 585 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:55:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 15:55:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2025-02-05 15:55:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:55:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-02-05 15:55:39,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 82 [2025-02-05 15:55:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-02-05 15:55:39,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 30 states have internal predecessors, (73), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 13 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-05 15:55:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-02-05 15:55:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:55:39,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:39,849 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:39,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:55:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:40,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2027470014, now seen corresponding path program 5 times [2025-02-05 15:55:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736016160] [2025-02-05 15:55:40,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:40,056 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 89 statements into 6 equivalence classes. [2025-02-05 15:55:40,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:55:40,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 15:55:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 15:55:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:40,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736016160] [2025-02-05 15:55:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736016160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:40,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533462174] [2025-02-05 15:55:40,801 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:40,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:40,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:40,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:55:40,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 89 statements into 6 equivalence classes. [2025-02-05 15:55:40,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:55:40,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 15:55:40,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:40,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-05 15:55:40,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 15:55:41,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:55:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533462174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:49,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:49,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 39] total 92 [2025-02-05 15:55:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736383856] [2025-02-05 15:55:49,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:49,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-02-05 15:55:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:49,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-02-05 15:55:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=8008, Unknown=0, NotChecked=0, Total=8372 [2025-02-05 15:55:49,839 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 92 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 56 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 36 states have return successors, (36), 36 states have call predecessors, (36), 15 states have call successors, (36) [2025-02-05 15:55:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:51,456 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2025-02-05 15:55:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 15:55:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 56 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 36 states have return successors, (36), 36 states have call predecessors, (36), 15 states have call successors, (36) Word has length 89 [2025-02-05 15:55:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:51,457 INFO L225 Difference]: With dead ends: 93 [2025-02-05 15:55:51,457 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 15:55:51,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=649, Invalid=12691, Unknown=0, NotChecked=0, Total=13340 [2025-02-05 15:55:51,460 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:51,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1267 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:55:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 15:55:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2025-02-05 15:55:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 14 states have return successors, (15), 14 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:55:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-02-05 15:55:51,471 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 89 [2025-02-05 15:55:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:51,471 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-02-05 15:55:51,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 56 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 36 states have return successors, (36), 36 states have call predecessors, (36), 15 states have call successors, (36) [2025-02-05 15:55:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-02-05 15:55:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 15:55:51,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:51,472 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:51,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:51,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:55:51,673 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2003525990, now seen corresponding path program 6 times [2025-02-05 15:55:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69736592] [2025-02-05 15:55:51,674 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:51,680 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 7 equivalence classes. [2025-02-05 15:55:51,704 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:55:51,704 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:55:51,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-05 15:55:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69736592] [2025-02-05 15:55:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69736592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990749103] [2025-02-05 15:55:52,505 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:52,507 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:52,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:55:52,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 7 equivalence classes. [2025-02-05 15:55:52,680 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:55:52,680 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:55:52,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:52,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-02-05 15:55:52,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 15:55:52,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:55:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990749103] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:55,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 42] total 51 [2025-02-05 15:55:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946453110] [2025-02-05 15:55:55,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:55,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-05 15:55:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:55,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-05 15:55:55,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2379, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 15:55:55,118 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2025-02-05 15:55:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:56,032 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2025-02-05 15:55:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 15:55:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) Word has length 96 [2025-02-05 15:55:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:56,033 INFO L225 Difference]: With dead ends: 99 [2025-02-05 15:55:56,033 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 15:55:56,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=447, Invalid=5103, Unknown=0, NotChecked=0, Total=5550 [2025-02-05 15:55:56,034 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:56,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 650 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:55:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 15:55:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2025-02-05 15:55:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:55:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-02-05 15:55:56,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 96 [2025-02-05 15:55:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:56,053 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-02-05 15:55:56,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2025-02-05 15:55:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-02-05 15:55:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:55:56,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:56,054 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:56,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:55:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:55:56,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1767227241, now seen corresponding path program 6 times [2025-02-05 15:55:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140790736] [2025-02-05 15:55:56,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:56,261 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 7 equivalence classes. [2025-02-05 15:55:56,278 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:55:56,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:55:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-02-05 15:55:56,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140790736] [2025-02-05 15:55:56,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140790736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748635409] [2025-02-05 15:55:56,841 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:56,844 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:56,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:55:57,021 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 7 equivalence classes. [2025-02-05 15:55:57,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:55:57,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:55:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:57,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-05 15:55:57,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 15:55:57,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:56:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748635409] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:10,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 34, 45] total 85 [2025-02-05 15:56:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750543419] [2025-02-05 15:56:10,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-02-05 15:56:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:10,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-02-05 15:56:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=6853, Unknown=0, NotChecked=0, Total=7140 [2025-02-05 15:56:10,061 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 85 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 54 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 31 states have return successors, (32), 31 states have call predecessors, (32), 18 states have call successors, (32) [2025-02-05 15:56:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:11,682 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2025-02-05 15:56:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 15:56:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 54 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 31 states have return successors, (32), 31 states have call predecessors, (32), 18 states have call successors, (32) Word has length 103 [2025-02-05 15:56:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:11,684 INFO L225 Difference]: With dead ends: 112 [2025-02-05 15:56:11,684 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 15:56:11,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=728, Invalid=13078, Unknown=0, NotChecked=0, Total=13806 [2025-02-05 15:56:11,686 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:11,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1100 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:56:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 15:56:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-05 15:56:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:56:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-02-05 15:56:11,708 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 103 [2025-02-05 15:56:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-02-05 15:56:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 54 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 31 states have return successors, (32), 31 states have call predecessors, (32), 18 states have call successors, (32) [2025-02-05 15:56:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-02-05 15:56:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:56:11,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:11,709 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:56:11,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:56:11,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -878255191, now seen corresponding path program 7 times [2025-02-05 15:56:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214874600] [2025-02-05 15:56:11,914 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:56:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:11,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:56:11,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:56:11,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:56:11,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-05 15:56:12,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214874600] [2025-02-05 15:56:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214874600] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555584894] [2025-02-05 15:56:12,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:56:12,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:12,964 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:12,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:56:13,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:56:13,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:56:13,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:56:13,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:13,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-05 15:56:13,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-05 15:56:13,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 15:56:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555584894] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:16,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 48] total 57 [2025-02-05 15:56:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811706270] [2025-02-05 15:56:16,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:16,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-05 15:56:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:16,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-05 15:56:16,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3000, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 15:56:16,423 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 18 states have call predecessors, (31), 19 states have call successors, (31) [2025-02-05 15:56:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:17,382 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2025-02-05 15:56:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 15:56:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 18 states have call predecessors, (31), 19 states have call successors, (31) Word has length 110 [2025-02-05 15:56:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:17,383 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:56:17,383 INFO L226 Difference]: Without dead ends: 66 [2025-02-05 15:56:17,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=528, Invalid=6612, Unknown=0, NotChecked=0, Total=7140 [2025-02-05 15:56:17,385 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:17,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 731 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:56:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-05 15:56:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-05 15:56:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:56:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-02-05 15:56:17,396 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 110 [2025-02-05 15:56:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-02-05 15:56:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 18 states have call predecessors, (31), 19 states have call successors, (31) [2025-02-05 15:56:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-02-05 15:56:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:56:17,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:17,397 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:17,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:56:17,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:56:17,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1749601976, now seen corresponding path program 8 times [2025-02-05 15:56:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48828838] [2025-02-05 15:56:17,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:56:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:17,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-02-05 15:56:17,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:56:17,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:56:17,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-05 15:56:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48828838] [2025-02-05 15:56:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48828838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500800032] [2025-02-05 15:56:18,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:56:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:18,733 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:18,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:56:19,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-02-05 15:56:19,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:56:19,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:56:19,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:19,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-02-05 15:56:19,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 15:56:19,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 368 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 15:56:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500800032] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:22,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:22,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 54] total 63 [2025-02-05 15:56:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472483372] [2025-02-05 15:56:22,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-05 15:56:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:22,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-05 15:56:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3691, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 15:56:22,818 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 63 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 43 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) [2025-02-05 15:56:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:24,133 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2025-02-05 15:56:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 15:56:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 43 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) Word has length 124 [2025-02-05 15:56:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:24,135 INFO L225 Difference]: With dead ends: 76 [2025-02-05 15:56:24,135 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 15:56:24,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=647, Invalid=8283, Unknown=0, NotChecked=0, Total=8930 [2025-02-05 15:56:24,137 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 166 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:24,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 944 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:56:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 15:56:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 15:56:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 19 states have return successors, (20), 19 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-05 15:56:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-02-05 15:56:24,147 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 124 [2025-02-05 15:56:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:24,148 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-02-05 15:56:24,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 43 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) [2025-02-05 15:56:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-02-05 15:56:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:56:24,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:24,149 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:24,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:56:24,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:24,350 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:24,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash -635588665, now seen corresponding path program 9 times [2025-02-05 15:56:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927706205] [2025-02-05 15:56:24,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:56:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:24,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 138 statements into 10 equivalence classes. [2025-02-05 15:56:24,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:56:24,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 15:56:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 15:56:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927706205] [2025-02-05 15:56:25,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927706205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545603608] [2025-02-05 15:56:25,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:56:25,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:25,674 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:56:25,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 138 statements into 10 equivalence classes. [2025-02-05 15:56:25,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:56:25,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 15:56:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:25,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-02-05 15:56:25,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-02-05 15:56:26,211 INFO L312 TraceCheckSpWp]: Computing backward predicates...