./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array19_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array19_pattern.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 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:12:22,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:12:22,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:12:22,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:12:22,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:12:22,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:12:22,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:12:22,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:12:22,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:12:22,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:12:22,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:12:22,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:12:22,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:12:22,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:12:22,785 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:12:22,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:12:22,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:12:22,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:12:22,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:12:22,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:12:22,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:12:22,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:12:22,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:12:22,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:12:22,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:12:22,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:12:22,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:12:22,788 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 -> 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a [2025-02-07 17:12:23,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:12:23,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:12:23,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:12:23,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:12:23,066 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:12:23,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array19_pattern.c [2025-02-07 17:12:24,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3c39a288/490b86fd79894b75a9c4b2c815649732/FLAGdfc48ed20 [2025-02-07 17:12:24,646 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:12:24,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array19_pattern.c [2025-02-07 17:12:24,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3c39a288/490b86fd79894b75a9c4b2c815649732/FLAGdfc48ed20 [2025-02-07 17:12:24,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3c39a288/490b86fd79894b75a9c4b2c815649732 [2025-02-07 17:12:24,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:12:24,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:12:24,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:12:24,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:12:24,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:12:24,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708b35f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24, skipping insertion in model container [2025-02-07 17:12:24,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:12:24,855 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/array-patterns/array19_pattern.c[1442,1455] [2025-02-07 17:12:24,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:12:24,888 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:12:24,898 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/array-patterns/array19_pattern.c[1442,1455] [2025-02-07 17:12:24,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:12:24,927 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:12:24,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24 WrapperNode [2025-02-07 17:12:24,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:12:24,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:12:24,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:12:24,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:12:24,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,962 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-02-07 17:12:24,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:12:24,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:12:24,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:12:24,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:12:24,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,988 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-07 17:12:24,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:24,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:25,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:25,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:25,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:25,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:12:25,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:12:25,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:12:25,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:12:25,013 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (1/1) ... [2025-02-07 17:12:25,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:12:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:25,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:12:25,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:12:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:12:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 17:12:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:12:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:12:25,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:12:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:12:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:12:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:12:25,130 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:12:25,132 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:12:25,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-07 17:12:25,331 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-07 17:12:25,331 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:12:25,339 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:12:25,339 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:12:25,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:12:25 BoogieIcfgContainer [2025-02-07 17:12:25,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:12:25,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:12:25,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:12:25,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:12:25,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:12:24" (1/3) ... [2025-02-07 17:12:25,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29368eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:12:25, skipping insertion in model container [2025-02-07 17:12:25,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:24" (2/3) ... [2025-02-07 17:12:25,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29368eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:12:25, skipping insertion in model container [2025-02-07 17:12:25,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:12:25" (3/3) ... [2025-02-07 17:12:25,347 INFO L128 eAbstractionObserver]: Analyzing ICFG array19_pattern.c [2025-02-07 17:12:25,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:12:25,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array19_pattern.c that has 2 procedures, 27 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 17:12:25,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:12:25,417 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;@34437c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:12:25,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:12:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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-07 17:12:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:12:25,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:25,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:25,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -340771675, now seen corresponding path program 1 times [2025-02-07 17:12:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16412429] [2025-02-07 17:12:25,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:25,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:12:25,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:12:25,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:25,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:12:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16412429] [2025-02-07 17:12:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16412429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:12:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610621570] [2025-02-07 17:12:25,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:25,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:12:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:25,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:12:25,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:12:25,591 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 17:12:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:25,601 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2025-02-07 17:12:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:12:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-07 17:12:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:25,606 INFO L225 Difference]: With dead ends: 52 [2025-02-07 17:12:25,607 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 17:12:25,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:12:25,611 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 17:12:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-07 17:12:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) 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-07 17:12:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-07 17:12:25,640 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2025-02-07 17:12:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:25,640 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-07 17:12:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 17:12:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-07 17:12:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:12:25,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:25,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:12:25,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 956768038, now seen corresponding path program 1 times [2025-02-07 17:12:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364756770] [2025-02-07 17:12:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:25,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 17:12:25,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:12:25,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:25,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:12:25,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:25,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364756770] [2025-02-07 17:12:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364756770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:25,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:12:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249350390] [2025-02-07 17:12:25,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:25,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:12:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:25,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:12:25,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:25,974 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:26,003 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-02-07 17:12:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:12:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-02-07 17:12:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:26,005 INFO L225 Difference]: With dead ends: 28 [2025-02-07 17:12:26,005 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 17:12:26,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:26,006 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 17:12:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 17:12:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-07 17:12:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-07 17:12:26,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 28 [2025-02-07 17:12:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:26,014 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-07 17:12:26,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-07 17:12:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 17:12:26,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:26,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:26,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:12:26,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1763352382, now seen corresponding path program 1 times [2025-02-07 17:12:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871415427] [2025-02-07 17:12:26,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:26,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 17:12:26,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:12:26,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:26,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:12:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871415427] [2025-02-07 17:12:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871415427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:12:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126971568] [2025-02-07 17:12:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:12:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:12:26,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:12:26,211 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:26,319 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2025-02-07 17:12:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:12:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-07 17:12:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:26,321 INFO L225 Difference]: With dead ends: 51 [2025-02-07 17:12:26,321 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 17:12:26,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:12:26,322 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:26,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:12:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 17:12:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-02-07 17:12:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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-07 17:12:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-07 17:12:26,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 31 [2025-02-07 17:12:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:26,326 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-07 17:12:26,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-07 17:12:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:12:26,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:26,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:26,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:12:26,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:26,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1811032412, now seen corresponding path program 1 times [2025-02-07 17:12:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:26,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-02-07 17:12:26,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:26,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:12:26,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:12:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:12:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-02-07 17:12:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92261208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:12:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800983646] [2025-02-07 17:12:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:12:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:12:26,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:26,433 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:26,488 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2025-02-07 17:12:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:12:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-02-07 17:12:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:26,489 INFO L225 Difference]: With dead ends: 51 [2025-02-07 17:12:26,489 INFO L226 Difference]: Without dead ends: 29 [2025-02-07 17:12:26,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:26,490 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:26,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-07 17:12:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-07 17:12:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-07 17:12:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-07 17:12:26,495 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 33 [2025-02-07 17:12:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:26,495 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-07 17:12:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-07 17:12:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:12:26,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:26,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:12:26,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:26,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash -351874274, now seen corresponding path program 1 times [2025-02-07 17:12:26,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:26,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93116631] [2025-02-07 17:12:26,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:26,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:26,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:26,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:12:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765649632] [2025-02-07 17:12:26,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:26,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:12:26,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:12:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:26,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-07 17:12:26,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:26,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:12:27,441 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-02-07 17:12:27,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2025-02-07 17:12:27,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:12:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:12:27,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:59,038 WARN L286 SmtUtils]: Spent 14.18s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 17:12:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93116631] [2025-02-07 17:12:59,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:12:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765649632] [2025-02-07 17:12:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765649632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:59,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:12:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-02-07 17:12:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761953668] [2025-02-07 17:12:59,535 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 17:12:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 17:12:59,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-02-07 17:12:59,538 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:13:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:00,032 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2025-02-07 17:13:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 17:13:00,033 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-02-07 17:13:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:00,034 INFO L225 Difference]: With dead ends: 79 [2025-02-07 17:13:00,034 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 17:13:00,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 17:13:00,036 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:00,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 142 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:13:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 17:13:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-07 17:13:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-02-07 17:13:00,044 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 34 [2025-02-07 17:13:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:00,045 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-07 17:13:00,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:13:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-02-07 17:13:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:13:00,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:00,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:00,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:13:00,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:00,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:00,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -222791555, now seen corresponding path program 1 times [2025-02-07 17:13:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317317077] [2025-02-07 17:13:00,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:00,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:13:00,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:13:00,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:00,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:13:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317317077] [2025-02-07 17:13:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317317077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:00,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:13:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660869663] [2025-02-07 17:13:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:00,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:13:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:00,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:13:00,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:13:00,296 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:13:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:00,335 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-02-07 17:13:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:13:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-02-07 17:13:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:00,336 INFO L225 Difference]: With dead ends: 74 [2025-02-07 17:13:00,336 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 17:13:00,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:13:00,337 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:00,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 17:13:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-02-07 17:13:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-02-07 17:13:00,353 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 34 [2025-02-07 17:13:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-02-07 17:13:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:13:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-02-07 17:13:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:13:00,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:00,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:00,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 17:13:00,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:00,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash -419305060, now seen corresponding path program 1 times [2025-02-07 17:13:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-02-07 17:13:00,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:00,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:13:00,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:13:00,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:00,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 17:13:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-02-07 17:13:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429618566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836733007] [2025-02-07 17:13:00,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:00,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:00,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:13:00,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:13:00,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:13:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:00,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 17:13:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:13:00,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 17:13:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836733007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:01,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2025-02-07 17:13:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074304431] [2025-02-07 17:13:01,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 17:13:01,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:01,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 17:13:01,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:13:01,186 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-07 17:13:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:01,834 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2025-02-07 17:13:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 17:13:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 34 [2025-02-07 17:13:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:01,837 INFO L225 Difference]: With dead ends: 205 [2025-02-07 17:13:01,837 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 17:13:01,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 17:13:01,838 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 168 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:01,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 230 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 17:13:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 17:13:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 95. [2025-02-07 17:13:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 81 states have internal predecessors, (105), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:13:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2025-02-07 17:13:01,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 34 [2025-02-07 17:13:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:01,873 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2025-02-07 17:13:01,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-07 17:13:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2025-02-07 17:13:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:13:01,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:01,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:01,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:02,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:02,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1977754664, now seen corresponding path program 2 times [2025-02-07 17:13:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517645457] [2025-02-07 17:13:02,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:13:02,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:13:02,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517645457] [2025-02-07 17:13:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517645457] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209291702] [2025-02-07 17:13:02,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:02,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:02,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:02,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:13:02,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:13:02,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:13:02,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:02,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:02,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:13:02,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:02,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209291702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:02,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:02,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:13:02,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160017553] [2025-02-07 17:13:02,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:02,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:13:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:02,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:13:02,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:13:02,336 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:02,447 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2025-02-07 17:13:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:13:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-02-07 17:13:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:02,449 INFO L225 Difference]: With dead ends: 140 [2025-02-07 17:13:02,449 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 17:13:02,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:13:02,449 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:02,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 17:13:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-02-07 17:13:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 81 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:13:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2025-02-07 17:13:02,463 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 35 [2025-02-07 17:13:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:02,463 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2025-02-07 17:13:02,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2025-02-07 17:13:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:13:02,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,464 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:02,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:13:02,664 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-07 17:13:02,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1317495196, now seen corresponding path program 3 times [2025-02-07 17:13:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332004460] [2025-02-07 17:13:02,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-02-07 17:13:02,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:13:02,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 17:13:02,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:13:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332004460] [2025-02-07 17:13:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332004460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271796284] [2025-02-07 17:13:02,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:02,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:02,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:13:02,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-02-07 17:13:02,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 35 statements. [2025-02-07 17:13:02,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:13:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-07 17:13:02,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-02-07 17:13:03,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 134 [2025-02-07 17:13:03,089 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-02-07 17:13:03,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 20 [2025-02-07 17:13:03,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:03,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 103 [2025-02-07 17:13:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:13:04,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2025-02-07 17:13:04,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:04,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 329 [2025-02-07 17:13:04,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:04,727 INFO L349 Elim1Store]: treesize reduction 143, result has 20.1 percent of original size [2025-02-07 17:13:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 240 [2025-02-07 17:13:04,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 177 [2025-02-07 17:13:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:13:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271796284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:05,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:05,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 31 [2025-02-07 17:13:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909619484] [2025-02-07 17:13:05,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:05,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 17:13:05,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:05,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 17:13:05,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-02-07 17:13:05,441 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-07 17:13:13,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-07 17:13:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:14,119 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2025-02-07 17:13:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-02-07 17:13:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 35 [2025-02-07 17:13:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:14,122 INFO L225 Difference]: With dead ends: 210 [2025-02-07 17:13:14,122 INFO L226 Difference]: Without dead ends: 175 [2025-02-07 17:13:14,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=882, Invalid=5124, Unknown=0, NotChecked=0, Total=6006 [2025-02-07 17:13:14,125 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 204 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:14,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 250 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-07 17:13:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-07 17:13:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 73. [2025-02-07 17:13:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:13:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-02-07 17:13:14,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 35 [2025-02-07 17:13:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-02-07 17:13:14,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-07 17:13:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-02-07 17:13:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 17:13:14,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:14,153 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:14,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:13:14,354 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-07 17:13:14,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1418381382, now seen corresponding path program 4 times [2025-02-07 17:13:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079107886] [2025-02-07 17:13:14,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:14,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:13:14,370 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 37 statements. [2025-02-07 17:13:14,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:13:14,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:13:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079107886] [2025-02-07 17:13:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079107886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681967362] [2025-02-07 17:13:14,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:14,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:14,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:13:14,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:13:14,497 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 37 statements. [2025-02-07 17:13:14,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:13:14,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:14,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 17:13:14,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:13:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681967362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:14,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:13:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27115613] [2025-02-07 17:13:14,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:13:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:14,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:13:14,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:13:14,597 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:14,688 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-02-07 17:13:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 17:13:14,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-07 17:13:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:14,690 INFO L225 Difference]: With dead ends: 83 [2025-02-07 17:13:14,690 INFO L226 Difference]: Without dead ends: 48 [2025-02-07 17:13:14,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:13:14,690 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:14,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-07 17:13:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2025-02-07 17:13:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:13:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-02-07 17:13:14,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 37 [2025-02-07 17:13:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-02-07 17:13:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-02-07 17:13:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 17:13:14,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:14,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:14,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:13:14,905 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-07 17:13:14,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2117025528, now seen corresponding path program 5 times [2025-02-07 17:13:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532849883] [2025-02-07 17:13:14,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:13:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:14,914 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-02-07 17:13:14,918 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 38 statements. [2025-02-07 17:13:14,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:13:14,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:13:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532849883] [2025-02-07 17:13:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532849883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123669493] [2025-02-07 17:13:14,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:13:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:14,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:14,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:13:15,017 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-02-07 17:13:15,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 38 statements. [2025-02-07 17:13:15,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:13:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:15,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:15,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:13:15,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:13:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123669493] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:15,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:13:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677419311] [2025-02-07 17:13:15,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:15,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:13:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:15,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:13:15,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:13:15,098 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:15,200 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2025-02-07 17:13:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:13:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-02-07 17:13:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:15,201 INFO L225 Difference]: With dead ends: 84 [2025-02-07 17:13:15,201 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 17:13:15,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:13:15,202 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:15,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 87 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 17:13:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-02-07 17:13:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:13:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-07 17:13:15,216 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 38 [2025-02-07 17:13:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-07 17:13:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-07 17:13:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 17:13:15,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:15,217 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:15,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:15,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 17:13:15,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1282131734, now seen corresponding path program 6 times [2025-02-07 17:13:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146604869] [2025-02-07 17:13:15,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:13:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:15,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 7 equivalence classes. [2025-02-07 17:13:15,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:13:15,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 17:13:15,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:13:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146604869] [2025-02-07 17:13:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146604869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406007402] [2025-02-07 17:13:15,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:13:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:15,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:13:15,571 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 7 equivalence classes. [2025-02-07 17:13:16,207 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:13:16,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 17:13:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:16,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:16,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:16,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:13:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406007402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:16,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-02-07 17:13:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490876446] [2025-02-07 17:13:16,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:16,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 17:13:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 17:13:16,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 17:13:16,309 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:16,442 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-07 17:13:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:13:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-02-07 17:13:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:16,443 INFO L225 Difference]: With dead ends: 50 [2025-02-07 17:13:16,444 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 17:13:16,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:13:16,445 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:16,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 17:13:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-07 17:13:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:13:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-07 17:13:16,456 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2025-02-07 17:13:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:16,456 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-07 17:13:16,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-07 17:13:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 17:13:16,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:16,457 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:16,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 17:13:16,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 446982062, now seen corresponding path program 7 times [2025-02-07 17:13:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427453926] [2025-02-07 17:13:16,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:13:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:16,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 17:13:16,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 17:13:16,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:16,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872136927] [2025-02-07 17:13:16,699 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:13:16,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:16,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:16,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:13:16,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 17:13:17,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 17:13:17,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:17,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:17,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-02-07 17:13:17,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:17,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:13:17,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:13:17,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:17,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:13:17,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:17,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 17:13:17,880 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-07 17:13:17,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 172 [2025-02-07 17:13:17,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:17,944 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2025-02-07 17:13:17,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 26 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 549 [2025-02-07 17:13:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:18,134 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-07 17:13:18,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 31 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 353 treesize of output 710 [2025-02-07 17:13:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 216 [2025-02-07 17:13:18,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:18,666 INFO L349 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2025-02-07 17:13:18,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 42 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 158 treesize of output 596 [2025-02-07 17:13:22,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 302 [2025-02-07 17:13:22,851 INFO L349 Elim1Store]: treesize reduction 674, result has 20.6 percent of original size [2025-02-07 17:13:22,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 290 treesize of output 510 [2025-02-07 17:13:23,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,791 INFO L349 Elim1Store]: treesize reduction 206, result has 5.1 percent of original size [2025-02-07 17:13:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 45 [2025-02-07 17:13:23,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 69 [2025-02-07 17:13:23,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,839 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 45 [2025-02-07 17:13:23,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 45 [2025-02-07 17:13:23,896 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,914 INFO L349 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2025-02-07 17:13:23,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 63 [2025-02-07 17:13:23,976 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:23,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 30 [2025-02-07 17:13:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:24,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:24,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 37 [2025-02-07 17:13:24,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:24,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:24,026 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:24,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 35 [2025-02-07 17:13:24,065 INFO L349 Elim1Store]: treesize reduction 15, result has 75.4 percent of original size [2025-02-07 17:13:24,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 329 treesize of output 301 [2025-02-07 17:13:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:13:24,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:51,336 WARN L286 SmtUtils]: Spent 10.32s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)