./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-simple/fibo_2calls_8-2.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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:04:37,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:04:37,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:04:37,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:04:37,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:04:37,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:04:37,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:04:37,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:04:37,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:04:37,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:04:37,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:04:37,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:04:37,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:04:37,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:04:37,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:04:37,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:04:37,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:04:37,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:04:37,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:04:37,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:04:37,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:04:37,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:04:37,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:04:37,543 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2025-02-07 21:04:37,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:04:37,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:04:37,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:04:37,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:04:37,822 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:04:37,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-02-07 21:04:39,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/457b0efe0/2807b3718af143f9b8cb131d8f018d3d/FLAG79f65c598 [2025-02-07 21:04:39,472 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:04:39,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-02-07 21:04:39,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/457b0efe0/2807b3718af143f9b8cb131d8f018d3d/FLAG79f65c598 [2025-02-07 21:04:39,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/457b0efe0/2807b3718af143f9b8cb131d8f018d3d [2025-02-07 21:04:39,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:04:39,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:04:39,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:04:39,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:04:39,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:04:39,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3433869c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39, skipping insertion in model container [2025-02-07 21:04:39,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:04:39,627 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-simple/fibo_2calls_8-2.c[947,960] [2025-02-07 21:04:39,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:04:39,640 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:04:39,653 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-simple/fibo_2calls_8-2.c[947,960] [2025-02-07 21:04:39,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:04:39,665 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:04:39,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39 WrapperNode [2025-02-07 21:04:39,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:04:39,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:04:39,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:04:39,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:04:39,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,691 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-02-07 21:04:39,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:04:39,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:04:39,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:04:39,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:04:39,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,716 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-07 21:04:39,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:04:39,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:04:39,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:04:39,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:04:39,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (1/1) ... [2025-02-07 21:04:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:04:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:39,763 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-07 21:04:39,765 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-07 21:04:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:04:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:04:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-02-07 21:04:39,781 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-02-07 21:04:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-02-07 21:04:39,781 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-02-07 21:04:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:04:39,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:04:39,822 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:04:39,823 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:04:39,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-02-07 21:04:39,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-02-07 21:04:39,934 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 21:04:39,935 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:04:39,945 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:04:39,945 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:04:39,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:04:39 BoogieIcfgContainer [2025-02-07 21:04:39,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:04:39,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:04:39,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:04:39,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:04:39,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:04:39" (1/3) ... [2025-02-07 21:04:39,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbed55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:04:39, skipping insertion in model container [2025-02-07 21:04:39,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:04:39" (2/3) ... [2025-02-07 21:04:39,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbed55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:04:39, skipping insertion in model container [2025-02-07 21:04:39,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:04:39" (3/3) ... [2025-02-07 21:04:39,956 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2025-02-07 21:04:39,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:04:39,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_8-2.c that has 3 procedures, 27 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:04:40,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:04:40,027 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;@75dcdee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:04:40,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:04:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:04:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 21:04:40,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:40,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:40,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:40,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:40,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1202197486, now seen corresponding path program 1 times [2025-02-07 21:04:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279984652] [2025-02-07 21:04:40,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:40,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 21:04:40,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 21:04:40,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:40,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:40,263 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-07 21:04:40,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279984652] [2025-02-07 21:04:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279984652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:04:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:04:40,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:04:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130422551] [2025-02-07 21:04:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:04:40,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:04:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:40,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:04:40,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:04:40,289 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:04:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:40,340 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-07 21:04:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:04:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-02-07 21:04:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:40,348 INFO L225 Difference]: With dead ends: 36 [2025-02-07 21:04:40,348 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 21:04:40,352 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-07 21:04:40,358 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:40,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:04:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 21:04:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-07 21:04:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 21:04:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-02-07 21:04:40,394 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2025-02-07 21:04:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:40,395 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-02-07 21:04:40,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:04:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-02-07 21:04:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 21:04:40,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:40,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:40,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:04:40,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash -362024635, now seen corresponding path program 1 times [2025-02-07 21:04:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758028926] [2025-02-07 21:04:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 21:04:40,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 21:04:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:40,491 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-07 21:04:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758028926] [2025-02-07 21:04:40,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758028926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:04:40,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:04:40,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:04:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729091799] [2025-02-07 21:04:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:04:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:04:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:40,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:04:40,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:04:40,494 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 21:04:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:40,525 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-02-07 21:04:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:04:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2025-02-07 21:04:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:40,528 INFO L225 Difference]: With dead ends: 32 [2025-02-07 21:04:40,529 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 21:04:40,529 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-07 21:04:40,530 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:40,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:04:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 21:04:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-07 21:04:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 21:04:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-02-07 21:04:40,541 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2025-02-07 21:04:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:40,542 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-02-07 21:04:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 21:04:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-02-07 21:04:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 21:04:40,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:40,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:40,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:04:40,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:40,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1370279311, now seen corresponding path program 1 times [2025-02-07 21:04:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813139903] [2025-02-07 21:04:40,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:40,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:40,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 21:04:40,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 21:04:40,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813139903] [2025-02-07 21:04:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813139903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035412724] [2025-02-07 21:04:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:40,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:40,678 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-07 21:04:40,680 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-07 21:04:40,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 21:04:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 21:04:40,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:40,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:04:40,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:40,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:41,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035412724] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:41,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:41,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-02-07 21:04:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934865878] [2025-02-07 21:04:41,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:41,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:04:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:41,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:04:41,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:04:41,062 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 21:04:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:41,203 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2025-02-07 21:04:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:04:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2025-02-07 21:04:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:41,205 INFO L225 Difference]: With dead ends: 54 [2025-02-07 21:04:41,205 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 21:04:41,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:04:41,206 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:41,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 138 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:04:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 21:04:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-07 21:04:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-07 21:04:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-07 21:04:41,224 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2025-02-07 21:04:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-07 21:04:41,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 21:04:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-07 21:04:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 21:04:41,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:41,227 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] [2025-02-07 21:04:41,235 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-07 21:04:41,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:41,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636893, now seen corresponding path program 1 times [2025-02-07 21:04:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072323235] [2025-02-07 21:04:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:41,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 21:04:41,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 21:04:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072323235] [2025-02-07 21:04:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072323235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118472753] [2025-02-07 21:04:41,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:41,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:41,563 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-07 21:04:41,566 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-07 21:04:41,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 21:04:41,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 21:04:41,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:41,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:41,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:04:41,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:41,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:04:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118472753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:41,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:41,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-07 21:04:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635562605] [2025-02-07 21:04:41,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 21:04:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:41,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 21:04:41,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:04:41,828 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:04:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:41,952 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2025-02-07 21:04:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:04:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2025-02-07 21:04:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:41,954 INFO L225 Difference]: With dead ends: 39 [2025-02-07 21:04:41,954 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 21:04:41,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:04:41,957 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:41,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 103 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:04:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 21:04:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-02-07 21:04:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-07 21:04:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-02-07 21:04:41,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2025-02-07 21:04:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-02-07 21:04:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:04:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-02-07 21:04:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 21:04:41,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:41,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:41,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:04:42,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:42,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:42,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1599200641, now seen corresponding path program 1 times [2025-02-07 21:04:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833226871] [2025-02-07 21:04:42,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:42,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 21:04:42,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 21:04:42,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:42,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 21:04:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833226871] [2025-02-07 21:04:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833226871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103266317] [2025-02-07 21:04:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:42,264 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-07 21:04:42,265 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-07 21:04:42,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 21:04:42,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 21:04:42,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:04:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 21:04:42,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 21:04:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103266317] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:42,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2025-02-07 21:04:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315324140] [2025-02-07 21:04:42,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 21:04:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:42,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 21:04:42,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:04:42,735 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 21:04:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:42,880 INFO L93 Difference]: Finished difference Result 68 states and 99 transitions. [2025-02-07 21:04:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 21:04:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2025-02-07 21:04:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:42,882 INFO L225 Difference]: With dead ends: 68 [2025-02-07 21:04:42,882 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 21:04:42,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:04:42,884 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:42,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:04:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 21:04:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-07 21:04:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-07 21:04:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-02-07 21:04:42,900 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2025-02-07 21:04:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-02-07 21:04:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 21:04:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-02-07 21:04:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 21:04:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:42,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:42,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 21:04:43,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:43,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:43,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -790926898, now seen corresponding path program 1 times [2025-02-07 21:04:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376479457] [2025-02-07 21:04:43,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:43,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 21:04:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 21:04:43,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:43,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 21:04:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:43,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376479457] [2025-02-07 21:04:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376479457] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:43,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581968999] [2025-02-07 21:04:43,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:43,252 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-07 21:04:43,255 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-07 21:04:43,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 21:04:43,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 21:04:43,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:43,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:43,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:04:43,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 21:04:43,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 21:04:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581968999] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:43,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-02-07 21:04:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54131951] [2025-02-07 21:04:43,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:04:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:43,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:04:43,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:04:43,691 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 21:04:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:44,077 INFO L93 Difference]: Finished difference Result 100 states and 160 transitions. [2025-02-07 21:04:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 21:04:44,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2025-02-07 21:04:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:44,080 INFO L225 Difference]: With dead ends: 100 [2025-02-07 21:04:44,080 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 21:04:44,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:04:44,082 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:44,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 297 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:04:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 21:04:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2025-02-07 21:04:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (34), 13 states have call predecessors, (34), 11 states have call successors, (34) [2025-02-07 21:04:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2025-02-07 21:04:44,105 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 36 [2025-02-07 21:04:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:44,105 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2025-02-07 21:04:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 21:04:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2025-02-07 21:04:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 21:04:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:44,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:44,131 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-07 21:04:44,327 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,SelfDestructingSolverStorable5 [2025-02-07 21:04:44,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 559327794, now seen corresponding path program 1 times [2025-02-07 21:04:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655294385] [2025-02-07 21:04:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:44,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 21:04:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 21:04:44,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:44,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 21:04:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655294385] [2025-02-07 21:04:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655294385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680922948] [2025-02-07 21:04:44,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:44,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:44,462 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-07 21:04:44,464 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-07 21:04:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 21:04:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 21:04:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:44,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 21:04:44,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 21:04:44,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 21:04:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680922948] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:45,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2025-02-07 21:04:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558136813] [2025-02-07 21:04:45,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:04:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:45,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:04:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:04:45,097 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-07 21:04:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:45,286 INFO L93 Difference]: Finished difference Result 101 states and 192 transitions. [2025-02-07 21:04:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:04:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2025-02-07 21:04:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:45,297 INFO L225 Difference]: With dead ends: 101 [2025-02-07 21:04:45,297 INFO L226 Difference]: Without dead ends: 97 [2025-02-07 21:04:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:04:45,298 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:45,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 138 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:04:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-07 21:04:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2025-02-07 21:04:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 43 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (48), 16 states have call predecessors, (48), 12 states have call successors, (48) [2025-02-07 21:04:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. [2025-02-07 21:04:45,323 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 50 [2025-02-07 21:04:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:45,326 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. [2025-02-07 21:04:45,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-07 21:04:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. [2025-02-07 21:04:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-07 21:04:45,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:45,333 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:45,340 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-07 21:04:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:45,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 387997922, now seen corresponding path program 1 times [2025-02-07 21:04:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987632260] [2025-02-07 21:04:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:45,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-07 21:04:45,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-07 21:04:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-07 21:04:45,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987632260] [2025-02-07 21:04:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987632260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560369778] [2025-02-07 21:04:45,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:04:45,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:45,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:45,728 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-07 21:04:45,730 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-07 21:04:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-07 21:04:45,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-07 21:04:45,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:04:45,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:45,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:04:45,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-07 21:04:45,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-07 21:04:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560369778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:46,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2025-02-07 21:04:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145543859] [2025-02-07 21:04:46,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:46,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:04:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:04:46,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:04:46,703 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) [2025-02-07 21:04:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:47,352 INFO L93 Difference]: Finished difference Result 176 states and 368 transitions. [2025-02-07 21:04:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-07 21:04:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) Word has length 92 [2025-02-07 21:04:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:47,355 INFO L225 Difference]: With dead ends: 176 [2025-02-07 21:04:47,355 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 21:04:47,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:04:47,358 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 88 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:47,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 419 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:04:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 21:04:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2025-02-07 21:04:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (43), 20 states have call predecessors, (43), 16 states have call successors, (43) [2025-02-07 21:04:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-02-07 21:04:47,388 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 92 [2025-02-07 21:04:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:47,390 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-02-07 21:04:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) [2025-02-07 21:04:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-02-07 21:04:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-07 21:04:47,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:47,398 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:47,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 21:04:47,602 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,SelfDestructingSolverStorable7 [2025-02-07 21:04:47,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:47,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash -335825774, now seen corresponding path program 2 times [2025-02-07 21:04:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3519131] [2025-02-07 21:04:47,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:04:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:47,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-07 21:04:47,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-07 21:04:47,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:04:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 47 proven. 183 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-07 21:04:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3519131] [2025-02-07 21:04:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3519131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903772942] [2025-02-07 21:04:47,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:04:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:47,868 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-07 21:04:47,870 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-07 21:04:47,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-07 21:04:47,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-07 21:04:47,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:04:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:47,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:04:47,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 34 proven. 239 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-07 21:04:48,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 34 proven. 255 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-02-07 21:04:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903772942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:49,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:49,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 23 [2025-02-07 21:04:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447462672] [2025-02-07 21:04:49,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:49,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:04:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:49,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:04:49,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:04:49,261 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-07 21:04:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:49,500 INFO L93 Difference]: Finished difference Result 131 states and 226 transitions. [2025-02-07 21:04:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 21:04:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) Word has length 159 [2025-02-07 21:04:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:49,503 INFO L225 Difference]: With dead ends: 131 [2025-02-07 21:04:49,503 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 21:04:49,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 302 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2025-02-07 21:04:49,507 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:49,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 162 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:04:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 21:04:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2025-02-07 21:04:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 21 states have call successors, (21), 8 states have call predecessors, (21), 19 states have return successors, (85), 30 states have call predecessors, (85), 21 states have call successors, (85) [2025-02-07 21:04:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 193 transitions. [2025-02-07 21:04:49,533 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 193 transitions. Word has length 159 [2025-02-07 21:04:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:49,535 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 193 transitions. [2025-02-07 21:04:49,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-07 21:04:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 193 transitions. [2025-02-07 21:04:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-07 21:04:49,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:49,541 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 23, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 10, 8, 7, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:49,549 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-07 21:04:49,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:49,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:49,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1770923511, now seen corresponding path program 3 times [2025-02-07 21:04:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789998135] [2025-02-07 21:04:49,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:04:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:49,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 391 statements into 20 equivalence classes. [2025-02-07 21:04:49,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 194 of 391 statements. [2025-02-07 21:04:49,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 21:04:49,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 581 proven. 111 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2025-02-07 21:04:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789998135] [2025-02-07 21:04:50,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789998135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129650700] [2025-02-07 21:04:50,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:04:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:50,176 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-07 21:04:50,178 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-07 21:04:50,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 391 statements into 20 equivalence classes. [2025-02-07 21:04:50,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 194 of 391 statements. [2025-02-07 21:04:50,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 21:04:50,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:50,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:04:50,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 577 proven. 113 refuted. 0 times theorem prover too weak. 3692 trivial. 0 not checked. [2025-02-07 21:04:50,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 577 proven. 125 refuted. 0 times theorem prover too weak. 3680 trivial. 0 not checked. [2025-02-07 21:04:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129650700] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:51,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 17 [2025-02-07 21:04:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320438004] [2025-02-07 21:04:51,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:04:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:51,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:04:51,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:04:51,768 INFO L87 Difference]: Start difference. First operand 117 states and 193 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-07 21:04:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:51,979 INFO L93 Difference]: Finished difference Result 172 states and 337 transitions. [2025-02-07 21:04:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:04:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) Word has length 391 [2025-02-07 21:04:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:51,983 INFO L225 Difference]: With dead ends: 172 [2025-02-07 21:04:51,983 INFO L226 Difference]: Without dead ends: 166 [2025-02-07 21:04:51,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 773 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:04:51,984 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 23 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:51,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 241 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:04:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-07 21:04:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2025-02-07 21:04:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 100 states have internal predecessors, (109), 27 states have call successors, (27), 9 states have call predecessors, (27), 26 states have return successors, (149), 41 states have call predecessors, (149), 27 states have call successors, (149) [2025-02-07 21:04:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 285 transitions. [2025-02-07 21:04:52,016 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 285 transitions. Word has length 391 [2025-02-07 21:04:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:52,017 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 285 transitions. [2025-02-07 21:04:52,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-07 21:04:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 285 transitions. [2025-02-07 21:04:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-07 21:04:52,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:52,024 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 23, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 10, 8, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:52,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 21:04:52,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:52,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 718676396, now seen corresponding path program 4 times [2025-02-07 21:04:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196469034] [2025-02-07 21:04:52,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:04:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:52,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 378 statements into 2 equivalence classes. [2025-02-07 21:04:52,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 321 of 378 statements. [2025-02-07 21:04:52,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:04:52,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 251 proven. 951 refuted. 0 times theorem prover too weak. 2874 trivial. 0 not checked. [2025-02-07 21:04:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196469034] [2025-02-07 21:04:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196469034] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449355493] [2025-02-07 21:04:52,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:04:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:52,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:52,770 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-07 21:04:52,773 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-07 21:04:52,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 378 statements into 2 equivalence classes. [2025-02-07 21:04:52,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 321 of 378 statements. [2025-02-07 21:04:52,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:04:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:52,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:04:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 1635 proven. 71 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2025-02-07 21:04:53,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 182 proven. 815 refuted. 0 times theorem prover too weak. 3079 trivial. 0 not checked. [2025-02-07 21:04:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449355493] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:54,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 15] total 28 [2025-02-07 21:04:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896659213] [2025-02-07 21:04:54,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:04:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:54,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:04:54,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:04:54,644 INFO L87 Difference]: Start difference. First operand 151 states and 285 transitions. Second operand has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 21 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (41), 15 states have call predecessors, (41), 21 states have call successors, (41) [2025-02-07 21:04:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:55,512 INFO L93 Difference]: Finished difference Result 358 states and 880 transitions. [2025-02-07 21:04:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 21:04:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 21 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (41), 15 states have call predecessors, (41), 21 states have call successors, (41) Word has length 378 [2025-02-07 21:04:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:55,516 INFO L225 Difference]: With dead ends: 358 [2025-02-07 21:04:55,516 INFO L226 Difference]: Without dead ends: 206 [2025-02-07 21:04:55,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 742 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 21:04:55,519 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:55,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 433 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:04:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-07 21:04:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 183. [2025-02-07 21:04:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.0731707317073171) internal successors, (132), 120 states have internal predecessors, (132), 30 states have call successors, (30), 16 states have call predecessors, (30), 29 states have return successors, (184), 46 states have call predecessors, (184), 30 states have call successors, (184) [2025-02-07 21:04:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 346 transitions. [2025-02-07 21:04:55,548 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 346 transitions. Word has length 378 [2025-02-07 21:04:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:55,548 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 346 transitions. [2025-02-07 21:04:55,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 21 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (41), 15 states have call predecessors, (41), 21 states have call successors, (41) [2025-02-07 21:04:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 346 transitions. [2025-02-07 21:04:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-07 21:04:55,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:55,555 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 25, 25, 22, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 8, 7, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:55,563 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-07 21:04:55,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:55,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 501400578, now seen corresponding path program 5 times [2025-02-07 21:04:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10496650] [2025-02-07 21:04:55,757 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:04:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:55,772 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 364 statements into 27 equivalence classes. [2025-02-07 21:04:55,792 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 155 of 364 statements. [2025-02-07 21:04:55,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-07 21:04:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 361 proven. 438 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2025-02-07 21:04:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10496650] [2025-02-07 21:04:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10496650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825580984] [2025-02-07 21:04:55,961 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:04:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:55,963 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-07 21:04:55,965 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-07 21:04:56,054 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 364 statements into 27 equivalence classes. [2025-02-07 21:04:56,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 155 of 364 statements. [2025-02-07 21:04:56,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-07 21:04:56,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:56,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:04:56,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 2200 proven. 55 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2025-02-07 21:04:56,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 364 proven. 454 refuted. 0 times theorem prover too weak. 2963 trivial. 0 not checked. [2025-02-07 21:04:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825580984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:57,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 18 [2025-02-07 21:04:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676982071] [2025-02-07 21:04:57,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:04:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:57,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:04:57,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:04:57,487 INFO L87 Difference]: Start difference. First operand 183 states and 346 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 11 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-07 21:04:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:57,786 INFO L93 Difference]: Finished difference Result 373 states and 849 transitions. [2025-02-07 21:04:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:04:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 11 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) Word has length 364 [2025-02-07 21:04:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:57,789 INFO L225 Difference]: With dead ends: 373 [2025-02-07 21:04:57,791 INFO L226 Difference]: Without dead ends: 199 [2025-02-07 21:04:57,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 717 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:04:57,794 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:57,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 166 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:04:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-07 21:04:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 176. [2025-02-07 21:04:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 115 states have internal predecessors, (128), 30 states have call successors, (30), 17 states have call predecessors, (30), 26 states have return successors, (156), 43 states have call predecessors, (156), 30 states have call successors, (156) [2025-02-07 21:04:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 314 transitions. [2025-02-07 21:04:57,817 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 314 transitions. Word has length 364 [2025-02-07 21:04:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:57,818 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 314 transitions. [2025-02-07 21:04:57,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 11 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-07 21:04:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 314 transitions. [2025-02-07 21:04:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-02-07 21:04:57,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:57,821 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:57,828 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-07 21:04:58,025 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,SelfDestructingSolverStorable11 [2025-02-07 21:04:58,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:04:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:04:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1672194187, now seen corresponding path program 6 times [2025-02-07 21:04:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:04:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670889356] [2025-02-07 21:04:58,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:04:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:04:58,038 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 282 statements into 15 equivalence classes. [2025-02-07 21:04:58,081 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 234 of 282 statements. [2025-02-07 21:04:58,081 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-02-07 21:04:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 398 proven. 74 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2025-02-07 21:04:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:04:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670889356] [2025-02-07 21:04:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670889356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:04:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734383603] [2025-02-07 21:04:58,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:04:58,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:04:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:04:58,342 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-07 21:04:58,344 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-07 21:04:58,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 282 statements into 15 equivalence classes. [2025-02-07 21:04:58,496 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 234 of 282 statements. [2025-02-07 21:04:58,496 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-02-07 21:04:58,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:04:58,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:04:58,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:04:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 405 proven. 77 refuted. 0 times theorem prover too weak. 1734 trivial. 0 not checked. [2025-02-07 21:04:58,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:04:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 409 proven. 83 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2025-02-07 21:04:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734383603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:04:59,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:04:59,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 17 [2025-02-07 21:04:59,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993491338] [2025-02-07 21:04:59,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:04:59,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:04:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:04:59,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:04:59,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:04:59,571 INFO L87 Difference]: Start difference. First operand 176 states and 314 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-02-07 21:04:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:04:59,788 INFO L93 Difference]: Finished difference Result 250 states and 539 transitions. [2025-02-07 21:04:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:04:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) Word has length 282 [2025-02-07 21:04:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:04:59,794 INFO L225 Difference]: With dead ends: 250 [2025-02-07 21:04:59,795 INFO L226 Difference]: Without dead ends: 240 [2025-02-07 21:04:59,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 554 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:04:59,796 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:04:59,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 161 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:04:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-07 21:04:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 219. [2025-02-07 21:04:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 146 states have (on average 1.0753424657534247) internal successors, (157), 142 states have internal predecessors, (157), 41 states have call successors, (41), 20 states have call predecessors, (41), 31 states have return successors, (264), 56 states have call predecessors, (264), 41 states have call successors, (264) [2025-02-07 21:04:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 462 transitions. [2025-02-07 21:04:59,822 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 462 transitions. Word has length 282 [2025-02-07 21:04:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:04:59,823 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 462 transitions. [2025-02-07 21:04:59,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-02-07 21:04:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 462 transitions. [2025-02-07 21:04:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 21:04:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:04:59,827 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 23, 23, 19, 19, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 8, 7, 6, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 21:04:59,836 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-07 21:05:00,031 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,SelfDestructingSolverStorable12 [2025-02-07 21:05:00,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 963024557, now seen corresponding path program 7 times [2025-02-07 21:05:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978362577] [2025-02-07 21:05:00,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 21:05:00,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 21:05:00,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:00,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 101 proven. 694 refuted. 0 times theorem prover too weak. 2391 trivial. 0 not checked. [2025-02-07 21:05:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978362577] [2025-02-07 21:05:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978362577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252265907] [2025-02-07 21:05:00,389 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:00,391 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-07 21:05:00,394 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-07 21:05:00,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 21:05:00,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 21:05:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:00,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 21:05:00,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 101 proven. 694 refuted. 0 times theorem prover too weak. 2391 trivial. 0 not checked. [2025-02-07 21:05:00,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 101 proven. 718 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2025-02-07 21:05:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252265907] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:02,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2025-02-07 21:05:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12503857] [2025-02-07 21:05:02,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 21:05:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:02,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 21:05:02,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-07 21:05:02,380 INFO L87 Difference]: Start difference. First operand 219 states and 462 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-07 21:05:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:02,584 INFO L93 Difference]: Finished difference Result 255 states and 602 transitions. [2025-02-07 21:05:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:05:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 335 [2025-02-07 21:05:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:02,589 INFO L225 Difference]: With dead ends: 255 [2025-02-07 21:05:02,589 INFO L226 Difference]: Without dead ends: 251 [2025-02-07 21:05:02,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 660 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-02-07 21:05:02,591 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:02,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 171 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-07 21:05:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2025-02-07 21:05:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 145 states have (on average 1.0758620689655172) internal successors, (156), 141 states have internal predecessors, (156), 40 states have call successors, (40), 20 states have call predecessors, (40), 31 states have return successors, (259), 55 states have call predecessors, (259), 40 states have call successors, (259) [2025-02-07 21:05:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 455 transitions. [2025-02-07 21:05:02,621 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 455 transitions. Word has length 335 [2025-02-07 21:05:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:02,622 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 455 transitions. [2025-02-07 21:05:02,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-07 21:05:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 455 transitions. [2025-02-07 21:05:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-07 21:05:02,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:02,627 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 39, 39, 36, 33, 24, 24, 24, 24, 24, 24, 24, 19, 19, 19, 19, 19, 19, 19, 17, 12, 9, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:02,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-07 21:05:02,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:02,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:02,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1476580581, now seen corresponding path program 8 times [2025-02-07 21:05:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:02,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005652411] [2025-02-07 21:05:02,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:02,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 594 statements into 2 equivalence classes. [2025-02-07 21:05:02,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 594 of 594 statements. [2025-02-07 21:05:02,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:02,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 224 proven. 1106 refuted. 0 times theorem prover too weak. 9092 trivial. 0 not checked. [2025-02-07 21:05:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005652411] [2025-02-07 21:05:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005652411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803474960] [2025-02-07 21:05:03,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:03,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:03,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:03,381 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-07 21:05:03,385 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-07 21:05:03,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 594 statements into 2 equivalence classes. [2025-02-07 21:05:03,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 594 of 594 statements. [2025-02-07 21:05:03,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:03,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:05:03,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 224 proven. 1106 refuted. 0 times theorem prover too weak. 9092 trivial. 0 not checked. [2025-02-07 21:05:03,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 224 proven. 1122 refuted. 0 times theorem prover too weak. 9076 trivial. 0 not checked. [2025-02-07 21:05:05,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803474960] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:05,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2025-02-07 21:05:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149065869] [2025-02-07 21:05:05,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:05,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:05:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:05,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:05:05,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:05:05,618 INFO L87 Difference]: Start difference. First operand 217 states and 455 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-07 21:05:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:05,796 INFO L93 Difference]: Finished difference Result 299 states and 898 transitions. [2025-02-07 21:05:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:05:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) Word has length 594 [2025-02-07 21:05:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:05,802 INFO L225 Difference]: With dead ends: 299 [2025-02-07 21:05:05,802 INFO L226 Difference]: Without dead ends: 295 [2025-02-07 21:05:05,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1179 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:05:05,804 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:05,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 134 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-07 21:05:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2025-02-07 21:05:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 157 states have (on average 1.070063694267516) internal successors, (168), 153 states have internal predecessors, (168), 44 states have call successors, (44), 20 states have call predecessors, (44), 35 states have return successors, (345), 63 states have call predecessors, (345), 44 states have call successors, (345) [2025-02-07 21:05:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 557 transitions. [2025-02-07 21:05:05,843 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 557 transitions. Word has length 594 [2025-02-07 21:05:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:05,844 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 557 transitions. [2025-02-07 21:05:05,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-07 21:05:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 557 transitions. [2025-02-07 21:05:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-07 21:05:05,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:05,849 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:05,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:06,050 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash 229469679, now seen corresponding path program 9 times [2025-02-07 21:05:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120299745] [2025-02-07 21:05:06,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:06,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 363 statements into 19 equivalence classes. [2025-02-07 21:05:06,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 65 of 363 statements. [2025-02-07 21:05:06,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:05:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 525 proven. 7 refuted. 0 times theorem prover too weak. 3228 trivial. 0 not checked. [2025-02-07 21:05:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120299745] [2025-02-07 21:05:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120299745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630851195] [2025-02-07 21:05:06,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:06,177 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-07 21:05:06,180 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-07 21:05:06,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 363 statements into 19 equivalence classes. [2025-02-07 21:05:06,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 65 of 363 statements. [2025-02-07 21:05:06,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:05:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:06,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:05:06,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 525 proven. 7 refuted. 0 times theorem prover too weak. 3228 trivial. 0 not checked. [2025-02-07 21:05:06,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 525 proven. 7 refuted. 0 times theorem prover too weak. 3228 trivial. 0 not checked. [2025-02-07 21:05:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630851195] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:07,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 14 [2025-02-07 21:05:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873439535] [2025-02-07 21:05:07,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 21:05:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:07,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 21:05:07,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:05:07,160 INFO L87 Difference]: Start difference. First operand 237 states and 557 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-07 21:05:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:07,283 INFO L93 Difference]: Finished difference Result 459 states and 1223 transitions. [2025-02-07 21:05:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:05:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 363 [2025-02-07 21:05:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:07,287 INFO L225 Difference]: With dead ends: 459 [2025-02-07 21:05:07,288 INFO L226 Difference]: Without dead ends: 231 [2025-02-07 21:05:07,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 718 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:05:07,292 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:07,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-07 21:05:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2025-02-07 21:05:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 151 states have (on average 1.0728476821192052) internal successors, (162), 147 states have internal predecessors, (162), 42 states have call successors, (42), 20 states have call predecessors, (42), 33 states have return successors, (305), 59 states have call predecessors, (305), 42 states have call successors, (305) [2025-02-07 21:05:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 509 transitions. [2025-02-07 21:05:07,320 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 509 transitions. Word has length 363 [2025-02-07 21:05:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 509 transitions. [2025-02-07 21:05:07,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-07 21:05:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 509 transitions. [2025-02-07 21:05:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-07 21:05:07,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:07,325 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 22, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:07,333 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-07 21:05:07,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 21:05:07,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1079933326, now seen corresponding path program 10 times [2025-02-07 21:05:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406026283] [2025-02-07 21:05:07,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:07,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 401 statements into 2 equivalence classes. [2025-02-07 21:05:07,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 340 of 401 statements. [2025-02-07 21:05:07,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:05:07,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4610 backedges. 171 proven. 579 refuted. 0 times theorem prover too weak. 3860 trivial. 0 not checked. [2025-02-07 21:05:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406026283] [2025-02-07 21:05:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406026283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399595775] [2025-02-07 21:05:07,737 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:07,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:07,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:07,739 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-07 21:05:07,742 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-07 21:05:07,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 401 statements into 2 equivalence classes. [2025-02-07 21:05:07,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 340 of 401 statements. [2025-02-07 21:05:07,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:05:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:07,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:05:07,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4610 backedges. 1017 proven. 6 refuted. 0 times theorem prover too weak. 3587 trivial. 0 not checked. [2025-02-07 21:05:07,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4610 backedges. 177 proven. 675 refuted. 0 times theorem prover too weak. 3758 trivial. 0 not checked. [2025-02-07 21:05:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399595775] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:08,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:08,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-07 21:05:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143000599] [2025-02-07 21:05:08,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 21:05:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:08,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 21:05:08,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:05:08,942 INFO L87 Difference]: Start difference. First operand 227 states and 509 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-02-07 21:05:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:09,082 INFO L93 Difference]: Finished difference Result 398 states and 966 transitions. [2025-02-07 21:05:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 21:05:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 401 [2025-02-07 21:05:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:09,085 INFO L225 Difference]: With dead ends: 398 [2025-02-07 21:05:09,085 INFO L226 Difference]: Without dead ends: 176 [2025-02-07 21:05:09,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 792 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:05:09,088 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:09,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-07 21:05:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2025-02-07 21:05:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.0714285714285714) internal successors, (120), 106 states have internal predecessors, (120), 27 states have call successors, (27), 19 states have call predecessors, (27), 22 states have return successors, (109), 36 states have call predecessors, (109), 27 states have call successors, (109) [2025-02-07 21:05:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 256 transitions. [2025-02-07 21:05:09,105 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 256 transitions. Word has length 401 [2025-02-07 21:05:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:09,105 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 256 transitions. [2025-02-07 21:05:09,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-02-07 21:05:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 256 transitions. [2025-02-07 21:05:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-07 21:05:09,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:09,108 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 25, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 10, 8, 8, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:09,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 21:05:09,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:09,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1079020415, now seen corresponding path program 11 times [2025-02-07 21:05:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386657813] [2025-02-07 21:05:09,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:05:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:09,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 404 statements into 27 equivalence classes. [2025-02-07 21:05:09,331 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 137 of 404 statements. [2025-02-07 21:05:09,331 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-07 21:05:09,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 258 proven. 664 refuted. 0 times theorem prover too weak. 3757 trivial. 0 not checked. [2025-02-07 21:05:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386657813] [2025-02-07 21:05:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386657813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718864933] [2025-02-07 21:05:09,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:05:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:09,497 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:09,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-07 21:05:09,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 404 statements into 27 equivalence classes. [2025-02-07 21:05:09,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 137 of 404 statements. [2025-02-07 21:05:09,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-07 21:05:09,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:09,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:05:09,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 1850 proven. 34 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2025-02-07 21:05:09,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 266 proven. 752 refuted. 0 times theorem prover too weak. 3661 trivial. 0 not checked. [2025-02-07 21:05:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718864933] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:10,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2025-02-07 21:05:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866302954] [2025-02-07 21:05:10,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:10,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 21:05:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:10,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 21:05:10,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:05:10,971 INFO L87 Difference]: Start difference. First operand 162 states and 256 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-07 21:05:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:11,241 INFO L93 Difference]: Finished difference Result 317 states and 543 transitions. [2025-02-07 21:05:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 21:05:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) Word has length 404 [2025-02-07 21:05:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:11,244 INFO L225 Difference]: With dead ends: 317 [2025-02-07 21:05:11,244 INFO L226 Difference]: Without dead ends: 164 [2025-02-07 21:05:11,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 795 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:05:11,246 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:11,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 227 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:05:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-07 21:05:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-02-07 21:05:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 105 states have internal predecessors, (117), 27 states have call successors, (27), 18 states have call predecessors, (27), 22 states have return successors, (101), 36 states have call predecessors, (101), 27 states have call successors, (101) [2025-02-07 21:05:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 245 transitions. [2025-02-07 21:05:11,260 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 245 transitions. Word has length 404 [2025-02-07 21:05:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:11,260 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 245 transitions. [2025-02-07 21:05:11,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-07 21:05:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 245 transitions. [2025-02-07 21:05:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-07 21:05:11,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:11,264 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 35, 35, 29, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 12, 10, 9, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-07 21:05:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-07 21:05:11,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1175828771, now seen corresponding path program 12 times [2025-02-07 21:05:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226132791] [2025-02-07 21:05:11,465 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:05:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:11,475 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 499 statements into 31 equivalence classes. [2025-02-07 21:05:11,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 226 of 499 statements. [2025-02-07 21:05:11,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-02-07 21:05:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7232 backedges. 343 proven. 582 refuted. 0 times theorem prover too weak. 6307 trivial. 0 not checked. [2025-02-07 21:05:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:11,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226132791] [2025-02-07 21:05:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226132791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:11,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921648163] [2025-02-07 21:05:11,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:05:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:11,678 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:11,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-07 21:05:11,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 499 statements into 31 equivalence classes. [2025-02-07 21:05:11,880 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 226 of 499 statements. [2025-02-07 21:05:11,880 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-02-07 21:05:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 21:05:11,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7232 backedges. 3393 proven. 17 refuted. 0 times theorem prover too weak. 3822 trivial. 0 not checked. [2025-02-07 21:05:11,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7232 backedges. 378 proven. 679 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2025-02-07 21:05:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921648163] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:13,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-02-07 21:05:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606805789] [2025-02-07 21:05:13,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 21:05:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:13,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 21:05:13,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:05:13,120 INFO L87 Difference]: Start difference. First operand 160 states and 245 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 9 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) [2025-02-07 21:05:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:13,315 INFO L93 Difference]: Finished difference Result 314 states and 525 transitions. [2025-02-07 21:05:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 21:05:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 9 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) Word has length 499 [2025-02-07 21:05:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:13,318 INFO L225 Difference]: With dead ends: 314 [2025-02-07 21:05:13,318 INFO L226 Difference]: Without dead ends: 158 [2025-02-07 21:05:13,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 986 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:05:13,320 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:13,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 149 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-07 21:05:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-07 21:05:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.0642201834862386) internal successors, (116), 104 states have internal predecessors, (116), 27 states have call successors, (27), 18 states have call predecessors, (27), 21 states have return successors, (97), 35 states have call predecessors, (97), 27 states have call successors, (97) [2025-02-07 21:05:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2025-02-07 21:05:13,337 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 499 [2025-02-07 21:05:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2025-02-07 21:05:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 9 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) [2025-02-07 21:05:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2025-02-07 21:05:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-07 21:05:13,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:13,340 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 28, 28, 25, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 11, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:13,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-07 21:05:13,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:13,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:13,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash -937228885, now seen corresponding path program 13 times [2025-02-07 21:05:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637667274] [2025-02-07 21:05:13,542 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:13,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-07 21:05:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-07 21:05:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 303 proven. 745 refuted. 0 times theorem prover too weak. 3639 trivial. 0 not checked. [2025-02-07 21:05:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637667274] [2025-02-07 21:05:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637667274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866974926] [2025-02-07 21:05:13,970 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:13,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:13,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:13,973 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:13,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-07 21:05:14,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-07 21:05:14,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-07 21:05:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:14,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 21:05:14,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 321 proven. 805 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [2025-02-07 21:05:14,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 323 proven. 833 refuted. 0 times theorem prover too weak. 3531 trivial. 0 not checked. [2025-02-07 21:05:16,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866974926] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:16,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:16,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-02-07 21:05:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229549233] [2025-02-07 21:05:16,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:16,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 21:05:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:16,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 21:05:16,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:05:16,559 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-07 21:05:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:16,859 INFO L93 Difference]: Finished difference Result 200 states and 355 transitions. [2025-02-07 21:05:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 21:05:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) Word has length 404 [2025-02-07 21:05:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:16,861 INFO L225 Difference]: With dead ends: 200 [2025-02-07 21:05:16,861 INFO L226 Difference]: Without dead ends: 140 [2025-02-07 21:05:16,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 794 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2025-02-07 21:05:16,862 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:16,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 408 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:05:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-07 21:05:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2025-02-07 21:05:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 92 states have internal predecessors, (104), 23 states have call successors, (23), 18 states have call predecessors, (23), 17 states have return successors, (48), 27 states have call predecessors, (48), 23 states have call successors, (48) [2025-02-07 21:05:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2025-02-07 21:05:16,873 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 404 [2025-02-07 21:05:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2025-02-07 21:05:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-07 21:05:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2025-02-07 21:05:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-07 21:05:16,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:16,876 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 24, 24, 22, 19, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:16,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:17,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -144893318, now seen corresponding path program 14 times [2025-02-07 21:05:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048170650] [2025-02-07 21:05:17,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:17,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 350 statements into 2 equivalence classes. [2025-02-07 21:05:17,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 21:05:17,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 246 proven. 484 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2025-02-07 21:05:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048170650] [2025-02-07 21:05:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048170650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284442022] [2025-02-07 21:05:17,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:17,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:17,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:17,344 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:17,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-07 21:05:17,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 350 statements into 2 equivalence classes. [2025-02-07 21:05:17,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 21:05:17,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:05:17,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 246 proven. 484 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2025-02-07 21:05:17,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 248 proven. 498 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2025-02-07 21:05:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284442022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:18,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2025-02-07 21:05:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190819913] [2025-02-07 21:05:18,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:05:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:05:18,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:05:18,913 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-07 21:05:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:19,073 INFO L93 Difference]: Finished difference Result 168 states and 226 transitions. [2025-02-07 21:05:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:05:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) Word has length 350 [2025-02-07 21:05:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:19,076 INFO L225 Difference]: With dead ends: 168 [2025-02-07 21:05:19,076 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:05:19,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 691 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:05:19,077 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:19,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 204 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:05:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2025-02-07 21:05:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.07) internal successors, (107), 95 states have internal predecessors, (107), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (54), 29 states have call predecessors, (54), 24 states have call successors, (54) [2025-02-07 21:05:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2025-02-07 21:05:19,091 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 350 [2025-02-07 21:05:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2025-02-07 21:05:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-07 21:05:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2025-02-07 21:05:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-07 21:05:19,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:19,094 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 23, 21, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 10, 7, 6, 5, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:19,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-07 21:05:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:19,295 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1543605547, now seen corresponding path program 15 times [2025-02-07 21:05:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418038975] [2025-02-07 21:05:19,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:19,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 377 statements into 24 equivalence classes. [2025-02-07 21:05:19,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 152 of 377 statements. [2025-02-07 21:05:19,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 21:05:19,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 727 proven. 94 refuted. 0 times theorem prover too weak. 3242 trivial. 0 not checked. [2025-02-07 21:05:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418038975] [2025-02-07 21:05:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418038975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748980667] [2025-02-07 21:05:19,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:19,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:19,660 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:19,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-07 21:05:19,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 377 statements into 24 equivalence classes. [2025-02-07 21:05:19,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 152 of 377 statements. [2025-02-07 21:05:19,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 21:05:19,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:19,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:05:19,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 816 proven. 96 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2025-02-07 21:05:20,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 816 proven. 99 refuted. 0 times theorem prover too weak. 3148 trivial. 0 not checked. [2025-02-07 21:05:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748980667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:21,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 26 [2025-02-07 21:05:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818307194] [2025-02-07 21:05:21,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 21:05:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:21,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 21:05:21,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-02-07 21:05:21,266 INFO L87 Difference]: Start difference. First operand 143 states and 185 transitions. Second operand has 26 states, 25 states have (on average 3.24) internal successors, (81), 26 states have internal predecessors, (81), 15 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2025-02-07 21:05:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:21,681 INFO L93 Difference]: Finished difference Result 202 states and 254 transitions. [2025-02-07 21:05:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 21:05:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.24) internal successors, (81), 26 states have internal predecessors, (81), 15 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 377 [2025-02-07 21:05:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:21,684 INFO L225 Difference]: With dead ends: 202 [2025-02-07 21:05:21,684 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:05:21,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 739 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 21:05:21,686 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:21,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:05:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:05:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2025-02-07 21:05:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 104 states have (on average 1.0673076923076923) internal successors, (111), 99 states have internal predecessors, (111), 26 states have call successors, (26), 19 states have call predecessors, (26), 18 states have return successors, (55), 30 states have call predecessors, (55), 26 states have call successors, (55) [2025-02-07 21:05:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2025-02-07 21:05:21,700 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 377 [2025-02-07 21:05:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2025-02-07 21:05:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.24) internal successors, (81), 26 states have internal predecessors, (81), 15 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2025-02-07 21:05:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2025-02-07 21:05:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-07 21:05:21,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:21,704 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:21,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:21,904 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash -412916885, now seen corresponding path program 16 times [2025-02-07 21:05:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379467363] [2025-02-07 21:05:21,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:21,915 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 459 statements into 2 equivalence classes. [2025-02-07 21:05:21,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 459 of 459 statements. [2025-02-07 21:05:21,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:05:21,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:05:21,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:05:21,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-07 21:05:22,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-07 21:05:22,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:05:22,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:05:22,095 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:05:22,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:05:22,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 21:05:22,100 INFO L422 BasicCegarLoop]: Path program histogram: [16, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:22,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:05:22,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:05:22 BoogieIcfgContainer [2025-02-07 21:05:22,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:05:22,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:05:22,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:05:22,204 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:05:22,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:04:39" (3/4) ... [2025-02-07 21:05:22,206 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:05:22,310 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 257. [2025-02-07 21:05:22,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:05:22,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:05:22,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:05:22,475 INFO L158 Benchmark]: Toolchain (without parser) took 42982.86ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 123.3MB in the beginning and 468.6MB in the end (delta: -345.3MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,475 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:05:22,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.42ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.7MB in the end (delta: 699.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:05:22,477 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,477 INFO L158 Benchmark]: IcfgBuilder took 213.32ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 99.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,477 INFO L158 Benchmark]: TraceAbstraction took 42254.79ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 98.5MB in the beginning and 485.4MB in the end (delta: -386.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,477 INFO L158 Benchmark]: Witness Printer took 268.96ms. Allocated memory is still 578.8MB. Free memory was 485.4MB in the beginning and 468.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:05:22,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.42ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.7MB in the end (delta: 699.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 213.32ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 99.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42254.79ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 98.5MB in the beginning and 485.4MB in the end (delta: -386.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Witness Printer took 268.96ms. Allocated memory is still 578.8MB. Free memory was 485.4MB in the beginning and 468.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 23, TraceHistogramMax: 48, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 963 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 861 mSDsluCounter, 4493 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3916 mSDsCounter, 853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5668 IncrementalHoareTripleChecker+Invalid, 6521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 853 mSolverCounterUnsat, 577 mSDtfsCounter, 5668 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11511 GetRequests, 10910 SyntacticMatches, 107 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3101 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=15, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 293 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 11596 NumberOfCodeBlocks, 8326 NumberOfCodeBlocksAsserted, 186 NumberOfCheckSat, 16634 ConstructedInterpolants, 0 QuantifiedInterpolants, 21869 SizeOfPredicates, 76 NumberOfNonLiveVariables, 8986 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 62 InterpolantComputations, 2 PerfectInterpolantSequences, 166533/184545 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 21:05:22,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE