./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gr2006.i --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/loop-lit/gr2006.i -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 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:59,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:59,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:16:59,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:59,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:59,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:59,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:59,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:59,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:59,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:59,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:59,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:59,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:59,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:59,645 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:59,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:59,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:59,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:59,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:59,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:59,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:59,647 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 -> 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 [2025-02-07 20:16:59,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:59,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:59,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:59,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:59,865 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:59,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gr2006.i [2025-02-07 20:17:01,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d40fe116/eccb5fed478147b6afd92a282e192a1d/FLAG33870897e [2025-02-07 20:17:01,298 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:17:01,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i [2025-02-07 20:17:01,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d40fe116/eccb5fed478147b6afd92a282e192a1d/FLAG33870897e [2025-02-07 20:17:01,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d40fe116/eccb5fed478147b6afd92a282e192a1d [2025-02-07 20:17:01,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:17:01,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:17:01,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:17:01,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:17:01,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:17:01,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75af176b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01, skipping insertion in model container [2025-02-07 20:17:01,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:17:01,455 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/loop-lit/gr2006.i[895,908] [2025-02-07 20:17:01,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:17:01,468 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:17:01,475 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/loop-lit/gr2006.i[895,908] [2025-02-07 20:17:01,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:17:01,488 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:17:01,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01 WrapperNode [2025-02-07 20:17:01,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:17:01,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:17:01,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:17:01,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:17:01,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,512 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-02-07 20:17:01,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:17:01,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:17:01,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:17:01,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:17:01,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,526 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 20:17:01,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:17:01,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:17:01,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:17:01,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:17:01,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (1/1) ... [2025-02-07 20:17:01,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:17:01,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:01,554 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 20:17:01,556 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 20:17:01,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:17:01,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:17:01,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:17:01,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:17:01,607 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:17:01,609 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:17:01,685 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:17:01,685 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:17:01,691 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:17:01,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:17:01,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:17:01 BoogieIcfgContainer [2025-02-07 20:17:01,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:17:01,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:17:01,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:17:01,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:17:01,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:17:01" (1/3) ... [2025-02-07 20:17:01,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b13f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:17:01, skipping insertion in model container [2025-02-07 20:17:01,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:17:01" (2/3) ... [2025-02-07 20:17:01,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b13f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:17:01, skipping insertion in model container [2025-02-07 20:17:01,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:17:01" (3/3) ... [2025-02-07 20:17:01,698 INFO L128 eAbstractionObserver]: Analyzing ICFG gr2006.i [2025-02-07 20:17:01,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:17:01,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gr2006.i that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:17:01,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:17:01,757 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;@5229f48c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:17:01,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:17:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:17:01,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:01,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:17:01,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 41950628, now seen corresponding path program 1 times [2025-02-07 20:17:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:01,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79855430] [2025-02-07 20:17:01,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:17:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:01,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:17:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:17:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:01,862 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 20:17:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79855430] [2025-02-07 20:17:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79855430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:17:01,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:17:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:17:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38078478] [2025-02-07 20:17:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:17:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:17:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:01,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:17:01,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:17:01,884 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:01,891 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-02-07 20:17:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:17:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-07 20:17:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:01,896 INFO L225 Difference]: With dead ends: 18 [2025-02-07 20:17:01,897 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 20:17:01,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:17:01,900 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:01,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:17:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 20:17:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 20:17:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-02-07 20:17:01,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2025-02-07 20:17:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:01,924 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-07 20:17:01,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-02-07 20:17:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:17:01,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:01,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:17:01,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:17:01,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:01,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1635958440, now seen corresponding path program 1 times [2025-02-07 20:17:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:01,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415503706] [2025-02-07 20:17:01,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:17:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:01,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:17:01,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:17:01,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:01,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,015 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 20:17:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415503706] [2025-02-07 20:17:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415503706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:17:02,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:17:02,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:17:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730776319] [2025-02-07 20:17:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:17:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:17:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:02,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:17:02,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:17:02,021 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:02,052 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-02-07 20:17:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:17:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:17:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:02,054 INFO L225 Difference]: With dead ends: 17 [2025-02-07 20:17:02,055 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 20:17:02,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:17:02,056 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:02,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:17:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 20:17:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2025-02-07 20:17:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-07 20:17:02,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2025-02-07 20:17:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-07 20:17:02,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-02-07 20:17:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:17:02,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:02,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:17:02,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:17:02,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1636881961, now seen corresponding path program 1 times [2025-02-07 20:17:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736078446] [2025-02-07 20:17:02,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:17:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:17:02,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:17:02,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,105 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 20:17:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736078446] [2025-02-07 20:17:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736078446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:17:02,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:17:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:17:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183300314] [2025-02-07 20:17:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:17:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:17:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:02,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:17:02,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:17:02,106 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:02,119 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-02-07 20:17:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:17:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:17:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:02,120 INFO L225 Difference]: With dead ends: 21 [2025-02-07 20:17:02,120 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 20:17:02,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:17:02,120 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:02,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:17:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 20:17:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-07 20:17:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-07 20:17:02,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2025-02-07 20:17:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:02,124 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-07 20:17:02,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-02-07 20:17:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:17:02,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:02,124 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:17:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:17:02,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:02,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -468035526, now seen corresponding path program 1 times [2025-02-07 20:17:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006853448] [2025-02-07 20:17:02,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:17:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:02,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:17:02,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:17:02,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:02,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006853448] [2025-02-07 20:17:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006853448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626772427] [2025-02-07 20:17:02,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:17:02,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:02,182 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 20:17:02,182 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 20:17:02,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:17:02,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:17:02,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:17:02,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:02,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626772427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-07 20:17:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278466053] [2025-02-07 20:17:02,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:02,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:17:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:02,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:17:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:17:02,298 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:02,332 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-02-07 20:17:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:17:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:17:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:02,333 INFO L225 Difference]: With dead ends: 31 [2025-02-07 20:17:02,333 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 20:17:02,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:17:02,334 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:02,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:17:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 20:17:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-07 20:17:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-07 20:17:02,340 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2025-02-07 20:17:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:02,341 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-07 20:17:02,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-07 20:17:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:17:02,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:02,342 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 20:17:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:17:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:02,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1792769303, now seen corresponding path program 2 times [2025-02-07 20:17:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926384149] [2025-02-07 20:17:02,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:17:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:02,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 20:17:02,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:17:02,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:17:02,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926384149] [2025-02-07 20:17:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926384149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347686237] [2025-02-07 20:17:02,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:17:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:02,658 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 20:17:02,660 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 20:17:02,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 20:17:02,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:17:02,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:17:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:02,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:17:02,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:17:02,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:17:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347686237] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:02,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-07 20:17:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062507563] [2025-02-07 20:17:02,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:02,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:17:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:02,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:17:02,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:17:02,832 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:02,938 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2025-02-07 20:17:02,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:17:02,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 20:17:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:02,938 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:17:02,938 INFO L226 Difference]: Without dead ends: 39 [2025-02-07 20:17:02,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-02-07 20:17:02,939 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:02,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:17:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-07 20:17:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-07 20:17:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-07 20:17:02,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2025-02-07 20:17:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:02,943 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-07 20:17:02,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-07 20:17:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:17:02,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:02,944 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 5, 5, 1, 1, 1, 1, 1] [2025-02-07 20:17:02,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:17:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:03,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 604059130, now seen corresponding path program 3 times [2025-02-07 20:17:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971116978] [2025-02-07 20:17:03,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:17:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:03,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 10 equivalence classes. [2025-02-07 20:17:03,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:17:03,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 20:17:03,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 20:17:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971116978] [2025-02-07 20:17:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971116978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651450536] [2025-02-07 20:17:03,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:17:03,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:03,304 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 20:17:03,305 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 20:17:03,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 10 equivalence classes. [2025-02-07 20:17:03,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:17:03,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 20:17:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:03,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:17:03,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:03,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651450536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:03,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-02-07 20:17:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79640972] [2025-02-07 20:17:03,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 20:17:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 20:17:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=551, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:17:03,705 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:04,129 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2025-02-07 20:17:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-07 20:17:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-07 20:17:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:04,130 INFO L225 Difference]: With dead ends: 122 [2025-02-07 20:17:04,130 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 20:17:04,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=981, Invalid=2325, Unknown=0, NotChecked=0, Total=3306 [2025-02-07 20:17:04,132 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:04,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:17:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 20:17:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2025-02-07 20:17:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-02-07 20:17:04,139 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 34 [2025-02-07 20:17:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-02-07 20:17:04,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-02-07 20:17:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-07 20:17:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:04,141 INFO L218 NwaCegarLoop]: trace histogram [26, 25, 20, 6, 1, 1, 1, 1, 1] [2025-02-07 20:17:04,147 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 20:17:04,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:04,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:04,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1939654311, now seen corresponding path program 4 times [2025-02-07 20:17:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:04,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28061119] [2025-02-07 20:17:04,342 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:17:04,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:04,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-02-07 20:17:04,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 20:17:04,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:17:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 25 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28061119] [2025-02-07 20:17:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28061119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826035263] [2025-02-07 20:17:04,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:17:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:04,864 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 20:17:04,866 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 20:17:04,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-02-07 20:17:04,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 20:17:04,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:17:04,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:04,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 20:17:04,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 98 proven. 876 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:17:05,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 98 proven. 876 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:17:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826035263] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:05,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 51 [2025-02-07 20:17:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122134081] [2025-02-07 20:17:05,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-07 20:17:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:05,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-07 20:17:05,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 20:17:05,771 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 51 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:05,915 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2025-02-07 20:17:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-07 20:17:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 51 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-07 20:17:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:05,918 INFO L225 Difference]: With dead ends: 200 [2025-02-07 20:17:05,919 INFO L226 Difference]: Without dead ends: 177 [2025-02-07 20:17:05,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 20:17:05,921 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:05,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 63 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:17:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-07 20:17:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-02-07 20:17:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.0406976744186047) internal successors, (179), 172 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2025-02-07 20:17:05,941 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 82 [2025-02-07 20:17:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2025-02-07 20:17:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 51 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2025-02-07 20:17:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-07 20:17:05,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:05,945 INFO L218 NwaCegarLoop]: trace histogram [56, 55, 50, 6, 1, 1, 1, 1, 1] [2025-02-07 20:17:05,951 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 20:17:06,146 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,SelfDestructingSolverStorable6 [2025-02-07 20:17:06,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:06,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1732963911, now seen corresponding path program 5 times [2025-02-07 20:17:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:06,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299146713] [2025-02-07 20:17:06,147 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:17:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:06,155 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 172 statements into 56 equivalence classes. [2025-02-07 20:17:06,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) and asserted 172 of 172 statements. [2025-02-07 20:17:06,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2025-02-07 20:17:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 4518 proven. 86 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:17:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299146713] [2025-02-07 20:17:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299146713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407649215] [2025-02-07 20:17:07,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:17:07,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:07,809 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 20:17:07,816 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 20:17:07,867 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 172 statements into 56 equivalence classes. [2025-02-07 20:17:07,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) and asserted 172 of 172 statements. [2025-02-07 20:17:07,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2025-02-07 20:17:07,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:07,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-07 20:17:07,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 4518 proven. 86 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:17:08,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 4518 proven. 86 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:17:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407649215] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:09,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 96 [2025-02-07 20:17:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68814846] [2025-02-07 20:17:09,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:09,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-02-07 20:17:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:09,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-02-07 20:17:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-02-07 20:17:09,036 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand has 97 states, 97 states have (on average 3.11340206185567) internal successors, (302), 96 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:09,483 INFO L93 Difference]: Finished difference Result 1032 states and 1352 transitions. [2025-02-07 20:17:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-07 20:17:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.11340206185567) internal successors, (302), 96 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-02-07 20:17:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:09,489 INFO L225 Difference]: With dead ends: 1032 [2025-02-07 20:17:09,489 INFO L226 Difference]: Without dead ends: 1028 [2025-02-07 20:17:09,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 293 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4964 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-02-07 20:17:09,493 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:09,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:17:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-07 20:17:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 308. [2025-02-07 20:17:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.1693811074918568) internal successors, (359), 307 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2025-02-07 20:17:09,515 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 172 [2025-02-07 20:17:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:09,515 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2025-02-07 20:17:09,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.11340206185567) internal successors, (302), 96 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2025-02-07 20:17:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-07 20:17:09,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:09,522 INFO L218 NwaCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1] [2025-02-07 20:17:09,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:17:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:09,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash 677145481, now seen corresponding path program 6 times [2025-02-07 20:17:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828227932] [2025-02-07 20:17:09,723 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 20:17:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:09,732 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 307 statements into 101 equivalence classes. [2025-02-07 20:17:09,807 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) and asserted 307 of 307 statements. [2025-02-07 20:17:09,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2025-02-07 20:17:09,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2025-02-07 20:17:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828227932] [2025-02-07 20:17:11,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828227932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495026317] [2025-02-07 20:17:11,486 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 20:17:11,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:11,488 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 20:17:11,489 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 20:17:11,535 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 307 statements into 101 equivalence classes. [2025-02-07 20:17:11,662 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) and asserted 307 of 307 statements. [2025-02-07 20:17:11,662 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2025-02-07 20:17:11,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:11,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 208 conjuncts are in the unsatisfiable core [2025-02-07 20:17:11,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:14,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:17:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495026317] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:14,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 103, 103] total 107 [2025-02-07 20:17:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78937080] [2025-02-07 20:17:14,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2025-02-07 20:17:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:14,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2025-02-07 20:17:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=11028, Unknown=0, NotChecked=0, Total=11342 [2025-02-07 20:17:14,346 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand has 107 states, 107 states have (on average 2.9626168224299065) internal successors, (317), 107 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:18,730 INFO L93 Difference]: Finished difference Result 4394 states and 5822 transitions. [2025-02-07 20:17:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-07 20:17:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 2.9626168224299065) internal successors, (317), 107 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-02-07 20:17:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:18,743 INFO L225 Difference]: With dead ends: 4394 [2025-02-07 20:17:18,743 INFO L226 Difference]: Without dead ends: 4234 [2025-02-07 20:17:18,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=11028, Unknown=0, NotChecked=0, Total=11342 [2025-02-07 20:17:18,747 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 49 mSDsluCounter, 10870 mSDsCounter, 0 mSdLazyCounter, 19069 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 11024 SdHoareTripleChecker+Invalid, 19120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:18,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 11024 Invalid, 19120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19069 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 20:17:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2025-02-07 20:17:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 4185. [2025-02-07 20:17:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 4184 states have (on average 1.0241395793499044) internal successors, (4285), 4184 states have internal predecessors, (4285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 4285 transitions. [2025-02-07 20:17:18,942 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 4285 transitions. Word has length 307 [2025-02-07 20:17:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 4285 transitions. [2025-02-07 20:17:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 2.9626168224299065) internal successors, (317), 107 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 4285 transitions. [2025-02-07 20:17:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-07 20:17:18,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:17:18,946 INFO L218 NwaCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1] [2025-02-07 20:17:18,953 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 20:17:19,151 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,SelfDestructingSolverStorable8 [2025-02-07 20:17:19,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:17:19,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:17:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1362588601, now seen corresponding path program 7 times [2025-02-07 20:17:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:17:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241790664] [2025-02-07 20:17:19,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 20:17:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:17:19,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-07 20:17:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-07 20:17:19,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:19,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7403 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-07 20:17:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:17:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241790664] [2025-02-07 20:17:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241790664] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:17:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722665864] [2025-02-07 20:17:21,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 20:17:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:17:21,478 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 20:17:21,479 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 20:17:21,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-07 20:17:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-07 20:17:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:17:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:17:21,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-07 20:17:21,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:17:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-07 20:17:21,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:17:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-07 20:17:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722665864] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:17:23,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:17:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 54 [2025-02-07 20:17:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534386278] [2025-02-07 20:17:23,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:17:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-07 20:17:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:17:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-07 20:17:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 20:17:23,553 INFO L87 Difference]: Start difference. First operand 4185 states and 4285 transitions. Second operand has 55 states, 55 states have (on average 3.890909090909091) internal successors, (214), 54 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:17:23,733 INFO L93 Difference]: Finished difference Result 4336 states and 4436 transitions. [2025-02-07 20:17:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-07 20:17:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.890909090909091) internal successors, (214), 54 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 310 [2025-02-07 20:17:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:17:23,736 INFO L225 Difference]: With dead ends: 4336 [2025-02-07 20:17:23,736 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:17:23,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 566 SyntacticMatches, 102 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3338 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 20:17:23,742 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:17:23,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:17:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:17:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:17:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:17:23,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2025-02-07 20:17:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:17:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:17:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.890909090909091) internal successors, (214), 54 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:17:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:17:23,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:17:23,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:17:23,756 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 20:17:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:17:23,953 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-02-07 20:17:23,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:17:25,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:17:25,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:17:25 BoogieIcfgContainer [2025-02-07 20:17:25,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:17:25,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:17:25,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:17:25,184 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:17:25,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:17:01" (3/4) ... [2025-02-07 20:17:25,186 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:17:25,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-07 20:17:25,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:17:25,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:17:25,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:17:25,255 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:17:25,255 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:17:25,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:17:25,256 INFO L158 Benchmark]: Toolchain (without parser) took 23930.20ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 111.4MB in the beginning and 451.9MB in the end (delta: -340.5MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,256 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:17:25,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.09ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.97ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.2MB in the end (delta: 894.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:17:25,256 INFO L158 Benchmark]: Boogie Preprocessor took 17.65ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,257 INFO L158 Benchmark]: IcfgBuilder took 161.02ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 88.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,257 INFO L158 Benchmark]: TraceAbstraction took 23489.81ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 87.9MB in the beginning and 456.2MB in the end (delta: -368.3MB). Peak memory consumption was 373.3MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,257 INFO L158 Benchmark]: Witness Printer took 71.88ms. Allocated memory is still 662.7MB. Free memory was 456.2MB in the beginning and 451.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:17:25,258 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.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.09ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.97ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.2MB in the end (delta: 894.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.65ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 161.02ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 88.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23489.81ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 87.9MB in the beginning and 456.2MB in the end (delta: -368.3MB). Peak memory consumption was 373.3MB. Max. memory is 16.1GB. * Witness Printer took 71.88ms. Allocated memory is still 662.7MB. Free memory was 456.2MB in the beginning and 451.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 10, TraceHistogramMax: 102, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 11570 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11298 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20241 IncrementalHoareTripleChecker+Invalid, 20453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 272 mSDtfsCounter, 20241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2164 GetRequests, 1659 SyntacticMatches, 117 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9303 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4185occurred in iteration=9, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 801 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 349 NumberOfCheckSat, 2797 ConstructedInterpolants, 0 QuantifiedInterpolants, 8195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 49396/109098 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 == y) && (98 == x)) || ((44 == y) && (44 == x))) || ((x == 15) && (y == 15))) || ((y == 39) && (x == 39))) || ((y == 33) && (x == 33))) || ((6 == y) && (6 == x))) || ((35 == y) && (x == 65))) || ((y == 10) && (x == 90))) || ((87 == x) && (y == 13))) || ((x == 1) && (y == 1))) || ((x == 63) && (y == 37))) || ((23 == y) && (23 == x))) || ((x == 86) && (14 == y))) || ((y == 28) && (x == 28))) || ((x == 24) && (y == 24))) || ((x == 13) && (y == 13))) || ((x == 26) && (y == 26))) || ((7 == y) && (7 == x))) || ((23 == y) && (77 == x))) || ((y == 12) && (88 == x))) || ((56 == x) && (44 == y))) || ((x == 25) && (y == 25))) || ((21 == y) && (21 == x))) || ((22 == y) && (x == 78))) || ((40 == y) && (40 == x))) || ((92 == x) && (y == 8))) || ((x == 8) && (y == 8))) || ((x == 34) && (y == 34))) || ((y == 26) && (x == 74))) || ((19 == x) && (19 == y))) || ((x == 36) && (y == 36))) || ((y == 43) && (57 == x))) || ((x == 54) && (46 == y))) || ((x == 11) && (y == 11))) || ((16 == x) && (16 == y))) || ((69 == x) && (31 == y))) || ((49 == x) && (49 == y))) || ((76 == x) && (y == 24))) || ((x == 73) && (y == 27))) || ((47 == y) && (47 == x))) || ((35 == y) && (35 == x))) || ((51 == x) && (49 == y))) || ((y == 18) && (82 == x))) || ((y == 10) && (x == 10))) || ((x == 96) && (y == 4))) || ((x == 58) && (42 == y))) || ((3 == y) && (97 == x))) || ((x == 37) && (y == 37))) || ((x == 75) && (y == 25))) || ((89 == x) && (y == 11))) || ((3 == x) && (3 == y))) || ((5 == x) && (5 == y))) || ((41 == y) && (59 == x))) || ((y == 17) && (x == 17))) || ((y == 28) && (72 == x))) || ((x == 70) && (30 == y))) || ((14 == y) && (14 == x))) || ((y == 39) && (x == 61))) || ((32 == y) && (32 == x))) || ((x == 60) && (40 == y))) || ((22 == y) && (22 == x))) || ((91 == x) && (9 == y))) || ((7 == y) && (x == 93))) || ((31 == x) && (31 == y))) || ((y == 27) && (x == 27))) || ((y == 0) && (x == 0))) || ((y == 12) && (x == 12))) || ((71 == x) && (29 == y))) || ((47 == y) && (53 == x))) || ((2 == x) && (2 == y))) || ((32 == y) && (68 == x))) || ((x == 83) && (y == 17))) || ((9 == x) && (9 == y))) || ((46 == y) && (46 == x))) || ((30 == x) && (30 == y))) || ((y == 34) && (66 == x))) || ((y == 48) && (52 == x))) || ((5 == y) && (95 == x))) || ((y == 20) && (x == 20))) || ((42 == y) && (42 == x))) || ((x == 18) && (y == 18))) || ((y == 45) && (x == 55))) || ((y == 38) && (62 == x))) || ((41 == y) && (41 == x))) || ((y == 20) && (x == 80))) || ((y == 43) && (x == 43))) || ((x == 79) && (21 == y))) || ((29 == x) && (29 == y))) || ((y == 4) && (x == 4))) || ((16 == y) && (84 == x))) || ((x == 85) && (y == 15))) || ((x == 99) && (y == 1))) || ((x == 100) && (y == 0))) || ((y == 50) && (x == 50))) || ((6 == y) && (94 == x))) || ((81 == x) && (19 == y))) || ((y == 45) && (x == 45))) || ((y == 48) && (x == 48))) || ((x == 38) && (y == 38))) || ((64 == x) && (y == 36))) || ((y == 33) && (67 == x))) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:17:25,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE