./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.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 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:56:09,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:56:09,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:56:09,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:56:09,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:56:09,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:56:09,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:56:09,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:56:09,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:56:09,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:56:09,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:56:09,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:56:09,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:56:09,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:56:09,858 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:56:09,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:56:09,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:56:09,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:56:09,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:56:09,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:56:09,860 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 -> 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f [2025-02-05 14:56:10,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:56:10,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:56:10,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:56:10,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:56:10,085 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:56:10,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2025-02-05 14:56:11,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8df04e75/38b9724e477d44c1a73de211c118e41a/FLAGb469087b8 [2025-02-05 14:56:11,598 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:56:11,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2025-02-05 14:56:11,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8df04e75/38b9724e477d44c1a73de211c118e41a/FLAGb469087b8 [2025-02-05 14:56:11,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8df04e75/38b9724e477d44c1a73de211c118e41a [2025-02-05 14:56:11,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:56:11,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:56:11,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:56:11,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:56:11,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:56:11,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4e59ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11, skipping insertion in model container [2025-02-05 14:56:11,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:56:11,782 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2025-02-05 14:56:11,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:56:11,806 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:56:11,814 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2025-02-05 14:56:11,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:56:11,833 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:56:11,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11 WrapperNode [2025-02-05 14:56:11,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:56:11,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:56:11,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:56:11,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:56:11,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,855 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2025-02-05 14:56:11,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:56:11,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:56:11,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:56:11,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:56:11,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 14:56:11,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:56:11,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:56:11,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:56:11,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:56:11,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (1/1) ... [2025-02-05 14:56:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:56:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:11,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:56:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:56:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:56:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:56:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:56:11,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:56:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 14:56:11,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 14:56:11,951 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:56:11,952 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:56:12,080 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 14:56:12,080 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:56:12,087 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:56:12,087 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:56:12,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:56:12 BoogieIcfgContainer [2025-02-05 14:56:12,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:56:12,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:56:12,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:56:12,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:56:12,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:56:11" (1/3) ... [2025-02-05 14:56:12,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38149817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:56:12, skipping insertion in model container [2025-02-05 14:56:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:11" (2/3) ... [2025-02-05 14:56:12,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38149817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:56:12, skipping insertion in model container [2025-02-05 14:56:12,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:56:12" (3/3) ... [2025-02-05 14:56:12,096 INFO L128 eAbstractionObserver]: Analyzing ICFG nested3-1_abstracted.c [2025-02-05 14:56:12,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:56:12,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested3-1_abstracted.c that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:56:12,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:56:12,156 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;@2338472a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:56:12,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:56:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:56:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:56:12,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:12,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:12,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash -503428240, now seen corresponding path program 1 times [2025-02-05 14:56:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717251419] [2025-02-05 14:56:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:56:12,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:56:12,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:12,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717251419] [2025-02-05 14:56:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717251419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:12,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:12,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336659181] [2025-02-05 14:56:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:12,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:12,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:12,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,344 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 14:56:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:12,378 INFO L93 Difference]: Finished difference Result 54 states and 83 transitions. [2025-02-05 14:56:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-05 14:56:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:12,384 INFO L225 Difference]: With dead ends: 54 [2025-02-05 14:56:12,384 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 14:56:12,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,389 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:12,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 14:56:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2025-02-05 14:56:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-05 14:56:12,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 7 [2025-02-05 14:56:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:12,416 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-05 14:56:12,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 14:56:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-05 14:56:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:56:12,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:12,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:56:12,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:12,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1534003482, now seen corresponding path program 1 times [2025-02-05 14:56:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12549498] [2025-02-05 14:56:12,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:12,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:12,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:56:12,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:56:12,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12549498] [2025-02-05 14:56:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12549498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289993113] [2025-02-05 14:56:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,462 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:12,475 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-02-05 14:56:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:56:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:12,475 INFO L225 Difference]: With dead ends: 44 [2025-02-05 14:56:12,476 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 14:56:12,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,477 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:12,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 14:56:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-02-05 14:56:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-02-05 14:56:12,482 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 8 [2025-02-05 14:56:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:12,483 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-05 14:56:12,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-02-05 14:56:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 14:56:12,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:12,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:12,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:56:12,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:12,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 266242922, now seen corresponding path program 1 times [2025-02-05 14:56:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:12,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147095315] [2025-02-05 14:56:12,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:12,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 14:56:12,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 14:56:12,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:12,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147095315] [2025-02-05 14:56:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147095315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540356492] [2025-02-05 14:56:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,572 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:12,599 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-02-05 14:56:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:12,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 14:56:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:12,600 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:56:12,600 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 14:56:12,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:12,601 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:12,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 14:56:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-05 14:56:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-05 14:56:12,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2025-02-05 14:56:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:12,609 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-05 14:56:12,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-05 14:56:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:56:12,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:12,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:56:12,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 319069077, now seen corresponding path program 1 times [2025-02-05 14:56:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:12,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056397707] [2025-02-05 14:56:12,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:12,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:56:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:56:12,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:12,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056397707] [2025-02-05 14:56:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056397707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:56:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247693390] [2025-02-05 14:56:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:12,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:56:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:12,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:56:12,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:56:12,899 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 14:56:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:13,016 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-02-05 14:56:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:56:13,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 14:56:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:13,017 INFO L225 Difference]: With dead ends: 44 [2025-02-05 14:56:13,017 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 14:56:13,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:56:13,018 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:13,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 14:56:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-02-05 14:56:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-05 14:56:13,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2025-02-05 14:56:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-05 14:56:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 14:56:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-05 14:56:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 14:56:13,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:13,024 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:56:13,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1380861744, now seen corresponding path program 1 times [2025-02-05 14:56:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345724695] [2025-02-05 14:56:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:13,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:56:13,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:56:13,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:13,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345724695] [2025-02-05 14:56:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345724695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506847541] [2025-02-05 14:56:13,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:13,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:13,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:56:13,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:56:13,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:56:13,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:13,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:13,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 14:56:13,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:13,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506847541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:13,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:13,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-02-05 14:56:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735657377] [2025-02-05 14:56:13,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:13,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:56:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:13,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:56:13,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:56:13,314 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:13,418 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-02-05 14:56:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:56:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-05 14:56:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:13,419 INFO L225 Difference]: With dead ends: 75 [2025-02-05 14:56:13,419 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 14:56:13,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:56:13,420 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:13,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 183 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 14:56:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-02-05 14:56:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:56:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-02-05 14:56:13,435 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2025-02-05 14:56:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:13,435 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-02-05 14:56:13,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-02-05 14:56:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 14:56:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:13,436 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:13,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:56:13,636 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-05 14:56:13,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1499496282, now seen corresponding path program 2 times [2025-02-05 14:56:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:13,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971638656] [2025-02-05 14:56:13,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:13,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 14:56:13,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 14:56:13,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:56:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971638656] [2025-02-05 14:56:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971638656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054382641] [2025-02-05 14:56:13,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:13,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:13,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:13,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:13,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:56:13,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 14:56:13,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 14:56:13,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:13,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:13,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:56:13,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:56:13,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:56:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054382641] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:14,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 14:56:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688322685] [2025-02-05 14:56:14,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 14:56:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 14:56:14,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:56:14,049 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:56:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:14,138 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2025-02-05 14:56:14,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:56:14,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2025-02-05 14:56:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:14,143 INFO L225 Difference]: With dead ends: 113 [2025-02-05 14:56:14,143 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 14:56:14,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:56:14,144 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:14,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 128 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 14:56:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 14:56:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 60 states have internal predecessors, (62), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 14:56:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-02-05 14:56:14,163 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 30 [2025-02-05 14:56:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:14,164 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-02-05 14:56:14,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:56:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-02-05 14:56:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 14:56:14,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:14,165 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:14,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:56:14,365 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-05 14:56:14,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:14,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1612391462, now seen corresponding path program 3 times [2025-02-05 14:56:14,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:14,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74420102] [2025-02-05 14:56:14,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:56:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:14,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 7 equivalence classes. [2025-02-05 14:56:14,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 74 statements. [2025-02-05 14:56:14,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 14:56:14,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 14:56:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74420102] [2025-02-05 14:56:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74420102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:56:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959777907] [2025-02-05 14:56:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:56:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:56:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:56:14,523 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:14,595 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-02-05 14:56:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:56:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-02-05 14:56:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:14,596 INFO L225 Difference]: With dead ends: 78 [2025-02-05 14:56:14,597 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 14:56:14,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:56:14,597 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:14,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 14:56:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2025-02-05 14:56:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 14:56:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-02-05 14:56:14,619 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 74 [2025-02-05 14:56:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:14,622 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-02-05 14:56:14,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:56:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-02-05 14:56:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 14:56:14,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:14,627 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:14,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:56:14,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:14,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1732001231, now seen corresponding path program 1 times [2025-02-05 14:56:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877684381] [2025-02-05 14:56:14,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:14,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 14:56:14,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 14:56:14,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:14,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 15 proven. 111 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 14:56:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877684381] [2025-02-05 14:56:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877684381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709246306] [2025-02-05 14:56:14,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:14,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:14,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:14,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:56:15,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 14:56:15,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 14:56:15,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:15,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:15,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 14:56:15,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 14:56:15,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 14:56:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709246306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:15,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2025-02-05 14:56:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662876965] [2025-02-05 14:56:15,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:15,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 14:56:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:15,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 14:56:15,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-02-05 14:56:15,355 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 14:56:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:15,901 INFO L93 Difference]: Finished difference Result 311 states and 362 transitions. [2025-02-05 14:56:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 14:56:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 81 [2025-02-05 14:56:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:15,903 INFO L225 Difference]: With dead ends: 311 [2025-02-05 14:56:15,903 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 14:56:15,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 14:56:15,904 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 228 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:15,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 694 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:56:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 14:56:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 228. [2025-02-05 14:56:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 192 states have internal predecessors, (197), 33 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 14:56:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 262 transitions. [2025-02-05 14:56:15,933 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 262 transitions. Word has length 81 [2025-02-05 14:56:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:15,933 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 262 transitions. [2025-02-05 14:56:15,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 14:56:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2025-02-05 14:56:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 14:56:15,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:15,936 INFO L218 NwaCegarLoop]: trace histogram [33, 32, 32, 28, 28, 28, 28, 28, 28, 28, 28, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:15,943 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-05 14:56:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:16,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -576474448, now seen corresponding path program 2 times [2025-02-05 14:56:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217583550] [2025-02-05 14:56:16,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:16,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 347 statements into 2 equivalence classes. [2025-02-05 14:56:16,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 14:56:16,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 1142 proven. 154 refuted. 0 times theorem prover too weak. 3538 trivial. 0 not checked. [2025-02-05 14:56:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217583550] [2025-02-05 14:56:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217583550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438575041] [2025-02-05 14:56:16,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:16,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:16,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:16,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:56:16,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 347 statements into 2 equivalence classes. [2025-02-05 14:56:16,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 14:56:16,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:16,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 14:56:16,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 64 proven. 2303 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-02-05 14:56:17,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 151 proven. 2216 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-02-05 14:56:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438575041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:18,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2025-02-05 14:56:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996602280] [2025-02-05 14:56:18,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 14:56:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 14:56:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-02-05 14:56:18,020 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-02-05 14:56:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:20,624 INFO L93 Difference]: Finished difference Result 851 states and 1001 transitions. [2025-02-05 14:56:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-05 14:56:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) Word has length 347 [2025-02-05 14:56:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:20,627 INFO L225 Difference]: With dead ends: 851 [2025-02-05 14:56:20,627 INFO L226 Difference]: Without dead ends: 676 [2025-02-05 14:56:20,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2157, Invalid=10499, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 14:56:20,632 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 392 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:20,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 3089 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:56:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-05 14:56:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 616. [2025-02-05 14:56:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 522 states have (on average 1.0210727969348659) internal successors, (533), 522 states have internal predecessors, (533), 91 states have call successors, (91), 3 states have call predecessors, (91), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 14:56:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 714 transitions. [2025-02-05 14:56:20,678 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 714 transitions. Word has length 347 [2025-02-05 14:56:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 714 transitions. [2025-02-05 14:56:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-02-05 14:56:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 714 transitions. [2025-02-05 14:56:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-02-05 14:56:20,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:20,695 INFO L218 NwaCegarLoop]: trace histogram [91, 90, 90, 80, 80, 80, 80, 80, 80, 80, 80, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:20,702 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-05 14:56:20,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 14:56:20,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:20,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 123326630, now seen corresponding path program 3 times [2025-02-05 14:56:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:20,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974426427] [2025-02-05 14:56:20,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:56:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:20,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 967 statements into 88 equivalence classes. [2025-02-05 14:56:20,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 115 of 967 statements. [2025-02-05 14:56:20,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 14:56:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4393 proven. 204 refuted. 0 times theorem prover too weak. 34713 trivial. 0 not checked. [2025-02-05 14:56:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974426427] [2025-02-05 14:56:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974426427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318001582] [2025-02-05 14:56:21,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:56:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:21,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:21,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:56:21,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 967 statements into 88 equivalence classes. [2025-02-05 14:56:21,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 115 of 967 statements. [2025-02-05 14:56:21,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 14:56:21,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:21,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:56:21,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4747 proven. 204 refuted. 0 times theorem prover too weak. 34359 trivial. 0 not checked. [2025-02-05 14:56:21,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4393 proven. 204 refuted. 0 times theorem prover too weak. 34713 trivial. 0 not checked. [2025-02-05 14:56:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318001582] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:21,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-02-05 14:56:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253647825] [2025-02-05 14:56:21,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 14:56:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 14:56:21,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:56:21,825 INFO L87 Difference]: Start difference. First operand 616 states and 714 transitions. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-02-05 14:56:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:22,724 INFO L93 Difference]: Finished difference Result 1872 states and 2259 transitions. [2025-02-05 14:56:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:56:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) Word has length 967 [2025-02-05 14:56:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:22,730 INFO L225 Difference]: With dead ends: 1872 [2025-02-05 14:56:22,730 INFO L226 Difference]: Without dead ends: 1316 [2025-02-05 14:56:22,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1952 GetRequests, 1925 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2025-02-05 14:56:22,732 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 60 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:22,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 602 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2025-02-05 14:56:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2025-02-05 14:56:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1122 states have (on average 1.0098039215686274) internal successors, (1133), 1122 states have internal predecessors, (1133), 191 states have call successors, (191), 3 states have call predecessors, (191), 2 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-02-05 14:56:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1514 transitions. [2025-02-05 14:56:22,828 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1514 transitions. Word has length 967 [2025-02-05 14:56:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1514 transitions. [2025-02-05 14:56:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-02-05 14:56:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1514 transitions. [2025-02-05 14:56:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2068 [2025-02-05 14:56:22,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:22,849 INFO L218 NwaCegarLoop]: trace histogram [191, 190, 190, 180, 180, 180, 180, 180, 180, 180, 180, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:22,855 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-05 14:56:23,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 14:56:23,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:23,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1973300966, now seen corresponding path program 4 times [2025-02-05 14:56:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:23,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131724679] [2025-02-05 14:56:23,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:56:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:23,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2067 statements into 2 equivalence classes. [2025-02-05 14:56:23,868 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2067 of 2067 statements. [2025-02-05 14:56:23,868 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 14:56:23,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 21153 proven. 1089 refuted. 0 times theorem prover too weak. 164718 trivial. 0 not checked. [2025-02-05 14:56:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131724679] [2025-02-05 14:56:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131724679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160286644] [2025-02-05 14:56:27,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:56:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:27,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:27,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:56:27,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2067 statements into 2 equivalence classes. [2025-02-05 14:56:27,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2067 of 2067 statements. [2025-02-05 14:56:27,977 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 14:56:27,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:27,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 3789 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 14:56:28,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 380 proven. 104763 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2025-02-05 14:56:29,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 948 proven. 104195 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2025-02-05 14:56:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160286644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:32,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 65 [2025-02-05 14:56:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180905861] [2025-02-05 14:56:32,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:32,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-05 14:56:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:32,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-05 14:56:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=3487, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 14:56:32,715 INFO L87 Difference]: Start difference. First operand 1316 states and 1514 transitions. Second operand has 65 states, 65 states have (on average 6.6923076923076925) internal successors, (435), 65 states have internal predecessors, (435), 60 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (81), 60 states have call predecessors, (81), 60 states have call successors, (81)