./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.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/dijkstra-u_unwindbound5.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 eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:28:32,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:28:32,911 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:28:32,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:28:32,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:28:32,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:28:32,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:28:32,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:28:32,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:28:32,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:28:32,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:28:32,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:28:32,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:28:32,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:28:32,956 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:28:32,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:28:32,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:28:32,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:28:32,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:28:32,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:28:32,958 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 -> eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f [2025-02-07 20:28:33,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:28:33,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:28:33,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:28:33,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:28:33,289 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:28:33,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2025-02-07 20:28:34,566 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d84e1f3f/111f9ca548d54625ae3c4e933ca04a0b/FLAG54f561fba [2025-02-07 20:28:34,817 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:28:34,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2025-02-07 20:28:34,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d84e1f3f/111f9ca548d54625ae3c4e933ca04a0b/FLAG54f561fba [2025-02-07 20:28:34,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d84e1f3f/111f9ca548d54625ae3c4e933ca04a0b [2025-02-07 20:28:34,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:28:34,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:28:34,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:28:34,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:28:34,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:28:34,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:28:34" (1/1) ... [2025-02-07 20:28:34,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67518463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:34, skipping insertion in model container [2025-02-07 20:28:34,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:28:34" (1/1) ... [2025-02-07 20:28:34,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:28:34,979 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/dijkstra-u_unwindbound5.c[525,538] [2025-02-07 20:28:35,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:28:35,014 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:28:35,027 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/dijkstra-u_unwindbound5.c[525,538] [2025-02-07 20:28:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:28:35,057 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:28:35,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35 WrapperNode [2025-02-07 20:28:35,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:28:35,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:28:35,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:28:35,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:28:35,065 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:28:35" (1/1) ... [2025-02-07 20:28:35,070 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:28:35" (1/1) ... [2025-02-07 20:28:35,080 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-02-07 20:28:35,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:28:35,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:28:35,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:28:35,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:28:35,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,104 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:28:35,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:28:35,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:28:35,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:28:35,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:28:35,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (1/1) ... [2025-02-07 20:28:35,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:28:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:35,139 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:28:35,145 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:28:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:28:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:28:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:28:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:28:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:28:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:28:35,209 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:28:35,211 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:28:35,355 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:28:35,355 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:28:35,361 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:28:35,361 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:28:35,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:28:35 BoogieIcfgContainer [2025-02-07 20:28:35,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:28:35,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:28:35,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:28:35,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:28:35,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:28:34" (1/3) ... [2025-02-07 20:28:35,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10238bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:28:35, skipping insertion in model container [2025-02-07 20:28:35,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:35" (2/3) ... [2025-02-07 20:28:35,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10238bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:28:35, skipping insertion in model container [2025-02-07 20:28:35,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:28:35" (3/3) ... [2025-02-07 20:28:35,367 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2025-02-07 20:28:35,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:28:35,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_unwindbound5.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:28:35,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:28:35,428 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;@5c9cdf63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:28:35,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:28:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:28:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:28:35,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1518983890, now seen corresponding path program 1 times [2025-02-07 20:28:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754476514] [2025-02-07 20:28:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:28:35,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:28:35,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,557 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:28:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:35,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754476514] [2025-02-07 20:28:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754476514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:35,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:28:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304449237] [2025-02-07 20:28:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:35,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:28:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:35,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:28:35,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:28:35,584 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:28:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:35,601 INFO L93 Difference]: Finished difference Result 54 states and 94 transitions. [2025-02-07 20:28:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:28:35,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:28:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:35,607 INFO L225 Difference]: With dead ends: 54 [2025-02-07 20:28:35,607 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:28:35,609 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:28:35,613 INFO L435 NwaCegarLoop]: 40 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, 40 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:28:35,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:28:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 20:28:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:28:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2025-02-07 20:28:35,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2025-02-07 20:28:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:35,646 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-02-07 20:28:35,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:28:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2025-02-07 20:28:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:28:35,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:28:35,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1098429594, now seen corresponding path program 1 times [2025-02-07 20:28:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818502920] [2025-02-07 20:28:35,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:28:35,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:28:35,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,784 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:28:35,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:35,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818502920] [2025-02-07 20:28:35,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818502920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:35,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:35,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:28:35,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913789890] [2025-02-07 20:28:35,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:35,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:28:35,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:35,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:28:35,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:28:35,788 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:28:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:35,827 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2025-02-07 20:28:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:28:35,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-02-07 20:28:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:35,831 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:28:35,831 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:28:35,832 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:28:35,832 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:35,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:28:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 20:28:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:28:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-02-07 20:28:35,841 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2025-02-07 20:28:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:35,841 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-07 20:28:35,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:28:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2025-02-07 20:28:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:28:35,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:28:35,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1249900870, now seen corresponding path program 1 times [2025-02-07 20:28:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515821759] [2025-02-07 20:28:35,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:28:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:28:35,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:36,231 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:28:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515821759] [2025-02-07 20:28:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515821759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:28:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462516486] [2025-02-07 20:28:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:36,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:28:36,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:36,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:28:36,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:28:36,233 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:28:37,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:37,453 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2025-02-07 20:28:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:28:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-02-07 20:28:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:37,454 INFO L225 Difference]: With dead ends: 63 [2025-02-07 20:28:37,454 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:28:37,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:28:37,455 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:37,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 20:28:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:28:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-02-07 20:28:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:28:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-02-07 20:28:37,464 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 12 [2025-02-07 20:28:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:37,464 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-02-07 20:28:37,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:28:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-02-07 20:28:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:28:37,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:37,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:37,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:28:37,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1250466899, now seen corresponding path program 1 times [2025-02-07 20:28:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211212393] [2025-02-07 20:28:37,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:28:37,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:28:37,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:37,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:37,527 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:28:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211212393] [2025-02-07 20:28:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211212393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:28:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926116833] [2025-02-07 20:28:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:28:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:28:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:28:37,531 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:28:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:37,554 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2025-02-07 20:28:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:28:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2025-02-07 20:28:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:37,555 INFO L225 Difference]: With dead ends: 51 [2025-02-07 20:28:37,556 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 20:28:37,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:28:37,557 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:37,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 20:28:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-02-07 20:28:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:28:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-02-07 20:28:37,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 12 [2025-02-07 20:28:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:37,568 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-02-07 20:28:37,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:28:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-02-07 20:28:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:28:37,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:37,569 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:37,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:28:37,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1378941817, now seen corresponding path program 1 times [2025-02-07 20:28:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422994392] [2025-02-07 20:28:37,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:37,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:28:37,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:28:37,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422994392] [2025-02-07 20:28:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422994392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692794276] [2025-02-07 20:28:37,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:37,615 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:28:37,617 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:28:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:28:37,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:28:37,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:37,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:28:37,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:37,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692794276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:37,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 20:28:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656168292] [2025-02-07 20:28:37,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:28:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:28:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:28:37,702 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:28:41,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:45,891 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-02-07 20:28:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:28:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 14 [2025-02-07 20:28:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:45,892 INFO L225 Difference]: With dead ends: 97 [2025-02-07 20:28:45,893 INFO L226 Difference]: Without dead ends: 78 [2025-02-07 20:28:45,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:28:45,893 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 175 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-07 20:28:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-07 20:28:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-02-07 20:28:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 20:28:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-02-07 20:28:45,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 14 [2025-02-07 20:28:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:45,905 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-02-07 20:28:45,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:28:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-02-07 20:28:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:28:45,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:45,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:45,918 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:28:46,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:46,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:46,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1143956549, now seen corresponding path program 1 times [2025-02-07 20:28:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105419711] [2025-02-07 20:28:46,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105419711] [2025-02-07 20:28:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105419711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012227975] [2025-02-07 20:28:46,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:46,337 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:28:46,338 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:28:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:46,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:46,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:46,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:28:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:46,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012227975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:46,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:46,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-07 20:28:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242657856] [2025-02-07 20:28:46,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:46,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:28:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:46,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:28:46,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:28:46,701 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:28:50,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:28:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:51,487 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2025-02-07 20:28:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:28:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:28:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:51,490 INFO L225 Difference]: With dead ends: 145 [2025-02-07 20:28:51,490 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 20:28:51,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:28:51,491 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 156 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:51,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 239 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 173 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-07 20:28:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 20:28:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 87. [2025-02-07 20:28:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 53 states have internal predecessors, (63), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-07 20:28:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-02-07 20:28:51,505 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 15 [2025-02-07 20:28:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-02-07 20:28:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:28:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-02-07 20:28:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:28:51,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:51,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:51,514 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:28:51,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:51,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:51,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1144522578, now seen corresponding path program 1 times [2025-02-07 20:28:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039416496] [2025-02-07 20:28:51,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:51,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:51,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:51,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039416496] [2025-02-07 20:28:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039416496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518132176] [2025-02-07 20:28:51,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:51,768 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:28:51,772 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:28:51,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:51,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:51,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:51,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:51,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:28:51,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:51,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518132176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:51,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-07 20:28:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918536197] [2025-02-07 20:28:51,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:28:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:51,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:28:51,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:28:51,857 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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:28:56,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:29:00,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:29:04,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:29:04,191 INFO L93 Difference]: Finished difference Result 140 states and 189 transitions. [2025-02-07 20:29:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:29:04,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 15 [2025-02-07 20:29:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:29:04,197 INFO L225 Difference]: With dead ends: 140 [2025-02-07 20:29:04,198 INFO L226 Difference]: Without dead ends: 130 [2025-02-07 20:29:04,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:29:04,199 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 90 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 32 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:29:04,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 185 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-02-07 20:29:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-07 20:29:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2025-02-07 20:29:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 77 states have internal predecessors, (89), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-07 20:29:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2025-02-07 20:29:04,220 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 15 [2025-02-07 20:29:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:29:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2025-02-07 20:29:04,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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:29:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2025-02-07 20:29:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:29:04,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:29:04,220 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:29:04,235 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:29:04,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:29:04,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:29:04,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:29:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash -713396090, now seen corresponding path program 1 times [2025-02-07 20:29:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:29:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800268218] [2025-02-07 20:29:04,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:29:04,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:29:04,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:29:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:04,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:29:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362828914] [2025-02-07 20:29:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:29:04,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:29:04,441 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:29:04,442 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:29:04,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:29:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:29:04,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:04,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:29:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:29:04,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:29:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:29:04,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:29:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:29:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800268218] [2025-02-07 20:29:04,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:29:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362828914] [2025-02-07 20:29:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362828914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:29:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:29:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:29:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192395434] [2025-02-07 20:29:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:29:04,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:29:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:29:04,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:29:04,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:29:04,517 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:29:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:29:04,582 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2025-02-07 20:29:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:29:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-07 20:29:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:29:04,584 INFO L225 Difference]: With dead ends: 166 [2025-02-07 20:29:04,584 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 20:29:04,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:29:04,584 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:29:04,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:29:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 20:29:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-07 20:29:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.2) internal successors, (108), 95 states have internal predecessors, (108), 55 states have call successors, (55), 14 states have call predecessors, (55), 13 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-07 20:29:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2025-02-07 20:29:04,599 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 22 [2025-02-07 20:29:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:29:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2025-02-07 20:29:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:29:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2025-02-07 20:29:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:29:04,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:29:04,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:29:04,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:29:04,804 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,SelfDestructingSolverStorable7 [2025-02-07 20:29:04,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:29:04,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:29:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 994370494, now seen corresponding path program 1 times [2025-02-07 20:29:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:29:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302193769] [2025-02-07 20:29:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:29:04,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:29:04,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:29:04,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:04,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:29:04,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600718498] [2025-02-07 20:29:04,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:04,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:29:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:29:04,830 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:29:04,831 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:29:04,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:29:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:29:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:29:04,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:29:04,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:29:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:29:04,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:29:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:29:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:29:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302193769] [2025-02-07 20:29:11,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:29:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600718498] [2025-02-07 20:29:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600718498] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:29:11,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:29:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-02-07 20:29:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015123578] [2025-02-07 20:29:11,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:29:11,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:29:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:29:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:29:11,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:29:11,236 INFO L87 Difference]: Start difference. First operand 159 states and 213 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 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:29:20,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:26,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:30,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:31,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:35,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:40,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:44,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:48,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:52,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:56,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:00,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:04,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:09,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:30:09,617 INFO L93 Difference]: Finished difference Result 237 states and 321 transitions. [2025-02-07 20:30:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:30:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 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 23 [2025-02-07 20:30:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:30:09,618 INFO L225 Difference]: With dead ends: 237 [2025-02-07 20:30:09,618 INFO L226 Difference]: Without dead ends: 206 [2025-02-07 20:30:09,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2025-02-07 20:30:09,619 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 78 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:30:09,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 340 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 200 Invalid, 12 Unknown, 0 Unchecked, 53.0s Time] [2025-02-07 20:30:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-07 20:30:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2025-02-07 20:30:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 113 states have (on average 1.176991150442478) internal successors, (133), 118 states have internal predecessors, (133), 66 states have call successors, (66), 19 states have call predecessors, (66), 18 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-07 20:30:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2025-02-07 20:30:09,639 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 23 [2025-02-07 20:30:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:30:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2025-02-07 20:30:09,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 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:30:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2025-02-07 20:30:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:30:09,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:30:09,640 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:30:09,646 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:30:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:30:09,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:30:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:30:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 715539494, now seen corresponding path program 2 times [2025-02-07 20:30:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:30:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893643705] [2025-02-07 20:30:09,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:30:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:30:09,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:30:09,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-02-07 20:30:09,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 20:30:09,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:30:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 20:30:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:30:09,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893643705] [2025-02-07 20:30:09,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893643705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:30:09,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:30:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:30:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652066402] [2025-02-07 20:30:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:30:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:30:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:30:09,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:30:09,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:30:09,902 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:30:13,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:30:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:30:13,999 INFO L93 Difference]: Finished difference Result 245 states and 321 transitions. [2025-02-07 20:30:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:30:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 23 [2025-02-07 20:30:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:30:14,004 INFO L225 Difference]: With dead ends: 245 [2025-02-07 20:30:14,004 INFO L226 Difference]: Without dead ends: 207 [2025-02-07 20:30:14,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:30:14,005 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:30:14,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 20:30:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-07 20:30:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2025-02-07 20:30:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 121 states have internal predecessors, (135), 66 states have call successors, (66), 20 states have call predecessors, (66), 19 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-07 20:30:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 262 transitions. [2025-02-07 20:30:14,046 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 262 transitions. Word has length 23 [2025-02-07 20:30:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:30:14,047 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 262 transitions. [2025-02-07 20:30:14,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:30:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 262 transitions. [2025-02-07 20:30:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 20:30:14,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:30:14,050 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:30:14,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:30:14,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:30:14,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:30:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 382302993, now seen corresponding path program 1 times [2025-02-07 20:30:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:30:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897577470] [2025-02-07 20:30:14,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:30:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:30:14,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:30:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:30:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:30:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:30:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:30:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:30:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897577470] [2025-02-07 20:30:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897577470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:30:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734575805] [2025-02-07 20:30:14,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:30:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:30:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:30:14,141 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:30:14,142 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:30:14,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:30:14,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:30:14,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:30:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:30:14,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:30:14,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:30:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:30:14,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:30:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:30:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734575805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:30:14,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:30:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-02-07 20:30:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269179577] [2025-02-07 20:30:14,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:30:14,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:30:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:30:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:30:14,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:30:14,259 INFO L87 Difference]: Start difference. First operand 202 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (3), 2 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:30:18,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []