./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:51:57,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:51:57,696 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:51:57,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:51:57,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:51:57,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:51:57,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:51:57,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:51:57,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:51:57,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:51:57,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:51:57,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:51:57,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:51:57,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:51:57,724 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:51:57,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:51:57,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:51:57,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:51:57,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:51:57,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:51:57,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:51:57,726 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 -> 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 [2025-02-07 20:51:58,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:51:58,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:51:58,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:51:58,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:51:58,019 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:51:58,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-02-07 20:51:59,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7a0ac54a/29c47259ca89477083e55f1b0996c0fe/FLAG4da9224ea [2025-02-07 20:51:59,480 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:51:59,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-02-07 20:51:59,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7a0ac54a/29c47259ca89477083e55f1b0996c0fe/FLAG4da9224ea [2025-02-07 20:51:59,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7a0ac54a/29c47259ca89477083e55f1b0996c0fe [2025-02-07 20:51:59,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:51:59,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:51:59,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:51:59,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:51:59,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:51:59,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6518a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59, skipping insertion in model container [2025-02-07 20:51:59,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:51:59,618 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/nla-digbench-scaling/prodbin-ll_unwindbound2.c[1175,1188] [2025-02-07 20:51:59,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:51:59,638 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:51:59,649 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/nla-digbench-scaling/prodbin-ll_unwindbound2.c[1175,1188] [2025-02-07 20:51:59,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:51:59,667 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:51:59,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59 WrapperNode [2025-02-07 20:51:59,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:51:59,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:51:59,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:51:59,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:51:59,677 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:51:59" (1/1) ... [2025-02-07 20:51:59,683 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:51:59" (1/1) ... [2025-02-07 20:51:59,695 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-02-07 20:51:59,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:51:59,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:51:59,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:51:59,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:51:59,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,718 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:51:59,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:51:59,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:51:59,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:51:59,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:51:59,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (1/1) ... [2025-02-07 20:51:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:51:59,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:59,757 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:51:59,762 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:51:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:51:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:51:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:51:59,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:51:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:51:59,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:51:59,822 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:51:59,823 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:51:59,952 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:51:59,953 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:51:59,959 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:51:59,959 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:51:59,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:59 BoogieIcfgContainer [2025-02-07 20:51:59,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:51:59,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:51:59,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:51:59,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:51:59,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:51:59" (1/3) ... [2025-02-07 20:51:59,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ba01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:51:59, skipping insertion in model container [2025-02-07 20:51:59,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:59" (2/3) ... [2025-02-07 20:51:59,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ba01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:51:59, skipping insertion in model container [2025-02-07 20:51:59,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:59" (3/3) ... [2025-02-07 20:51:59,973 INFO L128 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound2.c [2025-02-07 20:51:59,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:51:59,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prodbin-ll_unwindbound2.c that has 2 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:52:00,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:52:00,051 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;@300d327f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:52:00,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:52:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:52:00,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:00,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:00,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1866924571, now seen corresponding path program 1 times [2025-02-07 20:52:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053543596] [2025-02-07 20:52:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:00,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:52:00,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:52:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:00,180 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:52:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053543596] [2025-02-07 20:52:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053543596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:52:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:52:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:52:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687780585] [2025-02-07 20:52:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:52:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:52:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:00,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:52:00,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:52:00,208 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:00,221 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2025-02-07 20:52:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:52:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:52:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:00,227 INFO L225 Difference]: With dead ends: 36 [2025-02-07 20:52:00,227 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 20:52:00,229 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:52:00,231 INFO L435 NwaCegarLoop]: 22 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, 22 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:52:00,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:52:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 20:52:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 20:52:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:52:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-07 20:52:00,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2025-02-07 20:52:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:00,262 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-07 20:52:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-07 20:52:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:52:00,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:00,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:00,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:52:00,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash -554430939, now seen corresponding path program 1 times [2025-02-07 20:52:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943470293] [2025-02-07 20:52:00,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:00,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:52:00,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:52:00,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:00,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:52:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268535075] [2025-02-07 20:52:00,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:00,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:00,293 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:52:00,295 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:52:00,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:52:00,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:52:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:00,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:00,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 20:52:00,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:52:00,623 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:52:00,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:52:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943470293] [2025-02-07 20:52:00,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:52:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268535075] [2025-02-07 20:52:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268535075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:52:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:52:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:52:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473543406] [2025-02-07 20:52:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:52:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:52:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:00,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:52:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:52:00,629 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:00,723 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-02-07 20:52:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:52:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:52:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:00,724 INFO L225 Difference]: With dead ends: 34 [2025-02-07 20:52:00,724 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:52:00,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:52:00,725 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:00,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:52:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:52:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-02-07 20:52:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-07 20:52:00,731 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2025-02-07 20:52:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-07 20:52:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-07 20:52:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:52:00,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:00,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:00,738 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:52:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:00,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -553567000, now seen corresponding path program 1 times [2025-02-07 20:52:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352030654] [2025-02-07 20:52:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:00,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:52:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:52:00,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:00,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:01,021 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:52:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352030654] [2025-02-07 20:52:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352030654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:52:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:52:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:52:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632548636] [2025-02-07 20:52:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:52:01,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:52:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:01,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:52:01,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:52:01,022 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:01,034 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-02-07 20:52:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:52:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:52:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:01,035 INFO L225 Difference]: With dead ends: 31 [2025-02-07 20:52:01,035 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 20:52:01,035 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:52:01,035 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:01,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:52:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 20:52:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 20:52:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-07 20:52:01,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-02-07 20:52:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-07 20:52:01,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:52:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-07 20:52:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:52:01,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:01,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:01,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:52:01,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash 471451980, now seen corresponding path program 1 times [2025-02-07 20:52:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378642310] [2025-02-07 20:52:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:01,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:52:01,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31078871] [2025-02-07 20:52:01,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:01,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:01,084 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:52:01,087 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:52:01,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:01,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:01,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:01,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:01,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 20:52:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:52:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:01,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:52:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378642310] [2025-02-07 20:52:02,326 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:52:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31078871] [2025-02-07 20:52:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31078871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:52:02,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:52:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2025-02-07 20:52:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538555221] [2025-02-07 20:52:02,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:52:02,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:52:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:52:02,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:52:02,329 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:02,607 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-02-07 20:52:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:52:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-07 20:52:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:02,609 INFO L225 Difference]: With dead ends: 45 [2025-02-07 20:52:02,609 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 20:52:02,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:52:02,609 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:02,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:52:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 20:52:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-02-07 20:52:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:52:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-02-07 20:52:02,616 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 19 [2025-02-07 20:52:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-07 20:52:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-02-07 20:52:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:52:02,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:02,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:02,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:52:02,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:02,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:02,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash 472315919, now seen corresponding path program 1 times [2025-02-07 20:52:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101158182] [2025-02-07 20:52:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:02,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:02,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:02,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:02,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101158182] [2025-02-07 20:52:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101158182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:52:02,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801443287] [2025-02-07 20:52:02,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:02,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:02,918 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:52:02,927 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:52:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:02,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:02,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:02,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:02,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:52:02,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:52:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:03,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:52:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801443287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:52:03,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:52:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2025-02-07 20:52:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937617974] [2025-02-07 20:52:03,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:52:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:52:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:03,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:52:03,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:52:03,090 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:52:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:03,118 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-07 20:52:03,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:52:03,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-07 20:52:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:03,120 INFO L225 Difference]: With dead ends: 49 [2025-02-07 20:52:03,120 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 20:52:03,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:52:03,125 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:52:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 20:52:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-07 20:52:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:52:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-07 20:52:03,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 19 [2025-02-07 20:52:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-07 20:52:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:52:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-02-07 20:52:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:52:03,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:03,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:03,145 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:52:03,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:03,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2080704981, now seen corresponding path program 1 times [2025-02-07 20:52:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689700703] [2025-02-07 20:52:03,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:03,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:52:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620911063] [2025-02-07 20:52:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:03,363 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:52:03,365 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:52:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:52:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:52:03,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:03,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:03,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 20:52:03,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:52:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:03,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:52:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:52:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689700703] [2025-02-07 20:52:04,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:52:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620911063] [2025-02-07 20:52:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620911063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:52:04,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:52:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2025-02-07 20:52:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807040223] [2025-02-07 20:52:04,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:52:04,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:52:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:04,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:52:04,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:52:04,096 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:04,453 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-02-07 20:52:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 20:52:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-07 20:52:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:04,455 INFO L225 Difference]: With dead ends: 77 [2025-02-07 20:52:04,455 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 20:52:04,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-02-07 20:52:04,456 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:04,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 106 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:52:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 20:52:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-02-07 20:52:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 56 states have internal predecessors, (66), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:52:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-02-07 20:52:04,476 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 19 [2025-02-07 20:52:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:04,476 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-02-07 20:52:04,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:52:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-02-07 20:52:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:52:04,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:04,477 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:04,487 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:52:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-07 20:52:04,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -966658665, now seen corresponding path program 1 times [2025-02-07 20:52:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138463934] [2025-02-07 20:52:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:04,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:52:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:52:04,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:04,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:52:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533545464] [2025-02-07 20:52:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:52:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:04,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:04,704 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:52:04,706 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:52:04,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:52:04,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:52:04,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:52:04,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 20:52:04,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:52:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:52:04,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:52:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:52:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:52:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138463934] [2025-02-07 20:52:04,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:52:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533545464] [2025-02-07 20:52:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533545464] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:52:04,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:52:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-07 20:52:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872899041] [2025-02-07 20:52:04,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:52:04,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:52:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:52:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:52:04,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:52:04,851 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:52:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:52:04,897 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-07 20:52:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:52:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-02-07 20:52:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:52:04,898 INFO L225 Difference]: With dead ends: 74 [2025-02-07 20:52:04,898 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 20:52:04,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:52:04,899 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:52:04,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:52:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 20:52:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-07 20:52:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:52:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-02-07 20:52:04,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 25 [2025-02-07 20:52:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:52:04,907 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-02-07 20:52:04,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:52:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-02-07 20:52:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:52:04,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:52:04,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:04,914 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:52:05,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:05,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:52:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:52:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1401541002, now seen corresponding path program 2 times [2025-02-07 20:52:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:52:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684522004] [2025-02-07 20:52:05,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:52:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:52:05,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 20:52:05,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:52:05,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:52:05,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:52:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615321241] [2025-02-07 20:52:05,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:52:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:52:05,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:52:05,143 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:52:05,149 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:52:05,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 20:52:05,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:52:05,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:52:05,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:52:05,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:52:05,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:52:05,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:52:05,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:52:05,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:52:05,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:52:05,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:52:05,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:52:05,292 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:52:05,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:52:05,488 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-02-07 20:52:05,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:52:05,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:52:05 BoogieIcfgContainer [2025-02-07 20:52:05,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:52:05,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:52:05,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:52:05,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:52:05,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:59" (3/4) ... [2025-02-07 20:52:05,519 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:52:05,563 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-02-07 20:52:05,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:52:05,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:52:05,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:52:05,637 INFO L158 Benchmark]: Toolchain (without parser) took 6129.33ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 71.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2025-02-07 20:52:05,640 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.75ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: Boogie Preprocessor took 29.82ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: IcfgBuilder took 234.08ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: TraceAbstraction took 5551.16ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 77.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:52:05,641 INFO L158 Benchmark]: Witness Printer took 122.79ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 71.6MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:52:05,642 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.28ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.75ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.82ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 234.08ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5551.16ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 77.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 122.79ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 71.6MB in the end (delta: 6.4MB). 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 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int counter = 0; [L30] int a, b; [L31] long long x, y, z; [L33] a = __VERIFIER_nondet_int() [L34] b = __VERIFIER_nondet_int() [L35] CALL assume_abort_if_not(b >= 1) [L18] COND FALSE !(!cond) VAL [counter=0] [L35] RET assume_abort_if_not(b >= 1) [L37] x = a [L38] y = b [L39] z = 0 VAL [a=2, b=7, counter=0, x=2, y=7, z=0] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L41] COND TRUE counter++<2 [L42] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L42] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L43] COND FALSE !(!(y != 0)) VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L46] COND TRUE y % 2 == 1 [L47] z = z + x [L48] y = y - 1 VAL [a=2, b=7, counter=1, x=2, y=6, z=2] [L50] x = 2 * x [L51] y = y / 2 VAL [a=2, b=7, counter=1, x=4, y=3, z=2] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L41] COND TRUE counter++<2 [L42] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=2] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L42] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L43] COND FALSE !(!(y != 0)) VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L46] COND TRUE y % 2 == 1 [L47] z = z + x [L48] y = y - 1 VAL [a=2, b=7, counter=2, x=4, y=2, z=6] [L50] x = 2 * x [L51] y = y / 2 VAL [a=2, b=7, counter=2, x=8, y=1, z=6] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=3, x=8, y=1, z=6] [L41] COND FALSE !(counter++<2) [L53] CALL __VERIFIER_assert(z == (long long) a * b) VAL [\old(cond)=0, counter=3] [L21] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L23] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 449 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 107 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 197 ConstructedInterpolants, 3 QuantifiedInterpolants, 1194 SizeOfPredicates, 10 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 35/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 20:52:05,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE