./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_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/array23_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 e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:12:59,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:12:59,501 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:59,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:12:59,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:12:59,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:12:59,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:12:59,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:12:59,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:12:59,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:12:59,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:12:59,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:12:59,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:12:59,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:12:59,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:12:59,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:12:59,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:12:59,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:12:59,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:12:59,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:12:59,532 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2025-02-07 17:12:59,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:12:59,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:12:59,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:12:59,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:12:59,766 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:12:59,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2025-02-07 17:13:00,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08cb25196/012d86e70fdc45bf8caaf4819371fa09/FLAG2517df57e [2025-02-07 17:13:01,200 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:13:01,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2025-02-07 17:13:01,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08cb25196/012d86e70fdc45bf8caaf4819371fa09/FLAG2517df57e [2025-02-07 17:13:01,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08cb25196/012d86e70fdc45bf8caaf4819371fa09 [2025-02-07 17:13:01,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:13:01,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:13:01,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:01,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:13:01,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:13:01,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344d3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01, skipping insertion in model container [2025-02-07 17:13:01,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:13:01,631 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/array23_pattern.c[1347,1360] [2025-02-07 17:13:01,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:01,673 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:13:01,679 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/array23_pattern.c[1347,1360] [2025-02-07 17:13:01,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:01,694 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:13:01,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01 WrapperNode [2025-02-07 17:13:01,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:01,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:01,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:13:01,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:13:01,700 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:13:01" (1/1) ... [2025-02-07 17:13:01,704 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:13:01" (1/1) ... [2025-02-07 17:13:01,714 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-02-07 17:13:01,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:01,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:13:01,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:13:01,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:13:01,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,729 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:13:01,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:13:01,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:13:01,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:13:01,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:13:01,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (1/1) ... [2025-02-07 17:13:01,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:13:01,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:01,760 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:13:01,763 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:13:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-02-07 17:13:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-02-07 17:13:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 17:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:13:01,837 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:13:01,838 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:13:01,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: 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:13:01,989 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-07 17:13:01,989 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:13:01,995 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:13:01,995 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:13:01,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:01 BoogieIcfgContainer [2025-02-07 17:13:01,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:13:01,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:13:01,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:13:02,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:13:02,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:13:01" (1/3) ... [2025-02-07 17:13:02,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e1693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:02, skipping insertion in model container [2025-02-07 17:13:02,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:01" (2/3) ... [2025-02-07 17:13:02,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e1693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:02, skipping insertion in model container [2025-02-07 17:13:02,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:01" (3/3) ... [2025-02-07 17:13:02,003 INFO L128 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2025-02-07 17:13:02,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:13:02,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array23_pattern.c that has 3 procedures, 35 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 17:13:02,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:13:02,062 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;@45712f7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:13:02,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:13:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:13:02,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:02,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 998907557, now seen corresponding path program 1 times [2025-02-07 17:13:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306973935] [2025-02-07 17:13:02,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:13:02,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:13:02,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:02,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,166 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:13:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306973935] [2025-02-07 17:13:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306973935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:02,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:02,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:13:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624573075] [2025-02-07 17:13:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:02,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:13:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:02,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:13:02,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:13:02,188 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:13:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:02,200 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2025-02-07 17:13:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:13:02,202 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:13:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:02,205 INFO L225 Difference]: With dead ends: 68 [2025-02-07 17:13:02,205 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 17:13:02,207 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:13:02,208 INFO L435 NwaCegarLoop]: 45 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, 45 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:13:02,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 17:13:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-07 17:13:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-02-07 17:13:02,230 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 13 [2025-02-07 17:13:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-02-07 17:13:02,230 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:13:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-02-07 17:13:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 17:13:02,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,232 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, 1, 1, 1] [2025-02-07 17:13:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:13:02,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1317754935, now seen corresponding path program 1 times [2025-02-07 17:13:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42633875] [2025-02-07 17:13:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 17:13:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 17:13:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,465 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:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42633875] [2025-02-07 17:13:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42633875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:02,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804136133] [2025-02-07 17:13:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:02,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:02,467 INFO L87 Difference]: Start difference. First operand 31 states and 41 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:02,486 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-02-07 17:13:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:02,486 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-02-07 17:13:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:02,487 INFO L225 Difference]: With dead ends: 36 [2025-02-07 17:13:02,487 INFO L226 Difference]: Without dead ends: 33 [2025-02-07 17:13:02,487 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:13:02,488 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 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:13:02,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-07 17:13:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-07 17:13:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-02-07 17:13:02,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 40 [2025-02-07 17:13:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:02,493 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-02-07 17:13:02,494 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-02-07 17:13:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 17:13:02,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,494 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, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:13:02,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1146470593, now seen corresponding path program 1 times [2025-02-07 17:13:02,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267636176] [2025-02-07 17:13:02,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 17:13:02,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 17:13:02,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:02,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 17:13:02,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267636176] [2025-02-07 17:13:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267636176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:13:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991936687] [2025-02-07 17:13:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:02,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:13:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:02,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:13:02,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:13:02,664 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:02,746 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2025-02-07 17:13:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:13:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-02-07 17:13:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:02,747 INFO L225 Difference]: With dead ends: 67 [2025-02-07 17:13:02,748 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 17:13:02,748 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:13:02,749 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:02,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 17:13:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-02-07 17:13:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-07 17:13:02,757 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 43 [2025-02-07 17:13:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-07 17:13:02,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-07 17:13:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 17:13:02,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,759 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:13:02,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2056326493, now seen corresponding path program 1 times [2025-02-07 17:13:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384408252] [2025-02-07 17:13:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 17:13:02,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 17:13:02,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:13:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384408252] [2025-02-07 17:13:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384408252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896621978] [2025-02-07 17:13:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:02,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:02,860 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:02,897 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2025-02-07 17:13:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-02-07 17:13:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:02,898 INFO L225 Difference]: With dead ends: 67 [2025-02-07 17:13:02,898 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 17:13:02,898 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:13:02,899 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:02,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 17:13:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-07 17:13:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-02-07 17:13:02,909 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 45 [2025-02-07 17:13:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-02-07 17:13:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-02-07 17:13:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 17:13:02,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:02,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:02,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:13:02,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash 986832423, now seen corresponding path program 1 times [2025-02-07 17:13:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051572332] [2025-02-07 17:13:02,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:02,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:02,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 17:13:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 17:13:02,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:02,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051572332] [2025-02-07 17:13:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051572332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784974928] [2025-02-07 17:13:03,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:03,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:03,108 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:13:03,110 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:13:03,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 17:13:03,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 17:13:03,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:03,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:03,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:13:03,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:13:03,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784974928] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:03,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:03,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-07 17:13:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498448572] [2025-02-07 17:13:03,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:03,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:13:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:03,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:13:03,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:13:03,416 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 17:13:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:03,536 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-02-07 17:13:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 17:13:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 46 [2025-02-07 17:13:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:03,537 INFO L225 Difference]: With dead ends: 73 [2025-02-07 17:13:03,537 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 17:13:03,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:13:03,538 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:03,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 77 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 17:13:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-02-07 17:13:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-02-07 17:13:03,549 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 46 [2025-02-07 17:13:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-02-07 17:13:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 17:13:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-02-07 17:13:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 17:13:03,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:03,552 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:03,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:03,753 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:03,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -758628211, now seen corresponding path program 2 times [2025-02-07 17:13:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:03,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180118577] [2025-02-07 17:13:03,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:03,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 17:13:03,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 17:13:03,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:03,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 17:13:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180118577] [2025-02-07 17:13:03,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180118577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455251341] [2025-02-07 17:13:03,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:03,920 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:03,923 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:03,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 17:13:04,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 17:13:04,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:04,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:04,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:13:04,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:13:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455251341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:04,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-07 17:13:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390688643] [2025-02-07 17:13:04,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:04,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 17:13:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:04,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 17:13:04,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:13:04,138 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 17:13:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:04,324 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2025-02-07 17:13:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:13:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 48 [2025-02-07 17:13:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:04,326 INFO L225 Difference]: With dead ends: 84 [2025-02-07 17:13:04,327 INFO L226 Difference]: Without dead ends: 55 [2025-02-07 17:13:04,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-02-07 17:13:04,328 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:04,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-07 17:13:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-02-07 17:13:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 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:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-07 17:13:04,334 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 48 [2025-02-07 17:13:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:04,335 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-07 17:13:04,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 17:13:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-07 17:13:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:04,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:04,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:04,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:13:04,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:04,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:04,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1934120273, now seen corresponding path program 3 times [2025-02-07 17:13:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863386822] [2025-02-07 17:13:04,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:04,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 7 equivalence classes. [2025-02-07 17:13:04,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:04,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-07 17:13:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469489322] [2025-02-07 17:13:04,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:04,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:04,582 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:04,591 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:04,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 7 equivalence classes. [2025-02-07 17:13:05,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:05,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-07 17:13:05,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:05,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-02-07 17:13:05,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:05,916 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:05,965 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:06,139 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-02-07 17:13:06,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-02-07 17:13:06,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:06,199 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:07,167 INFO L349 Elim1Store]: treesize reduction 208, result has 33.5 percent of original size [2025-02-07 17:13:07,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 74 treesize of output 142 [2025-02-07 17:13:07,985 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 148 treesize of output 126 [2025-02-07 17:13:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,031 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-07 17:13:08,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 126 treesize of output 223 [2025-02-07 17:13:08,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:08,201 INFO L349 Elim1Store]: treesize reduction 144, result has 37.1 percent of original size [2025-02-07 17:13:08,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 171 [2025-02-07 17:13:09,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:09,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 case distinctions, treesize of input 154 treesize of output 90 [2025-02-07 17:13:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:13:09,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863386822] [2025-02-07 17:13:10,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:13:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469489322] [2025-02-07 17:13:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469489322] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:10,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:13:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2025-02-07 17:13:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541847067] [2025-02-07 17:13:10,958 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-07 17:13:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:10,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-07 17:13:10,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 17:13:10,960 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:12,150 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2025-02-07 17:13:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 17:13:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2025-02-07 17:13:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:12,151 INFO L225 Difference]: With dead ends: 136 [2025-02-07 17:13:12,151 INFO L226 Difference]: Without dead ends: 97 [2025-02-07 17:13:12,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=2651, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 17:13:12,153 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:12,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 386 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 17:13:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-07 17:13:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-02-07 17:13:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:13:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2025-02-07 17:13:12,165 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 56 [2025-02-07 17:13:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:12,165 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2025-02-07 17:13:12,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:13:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2025-02-07 17:13:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:12,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:12,166 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:12,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:12,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:12,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:12,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash -853295214, now seen corresponding path program 1 times [2025-02-07 17:13:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905784042] [2025-02-07 17:13:12,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:12,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:12,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:12,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905784042] [2025-02-07 17:13:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905784042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360569968] [2025-02-07 17:13:12,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:12,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:12,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:12,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:12,424 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:12,443 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2025-02-07 17:13:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-02-07 17:13:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:12,445 INFO L225 Difference]: With dead ends: 129 [2025-02-07 17:13:12,446 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 17:13:12,447 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:13:12,448 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:12,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 17:13:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-07 17:13:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-07 17:13:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2025-02-07 17:13:12,469 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 56 [2025-02-07 17:13:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2025-02-07 17:13:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2025-02-07 17:13:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:12,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:12,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 17:13:12,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1697767085, now seen corresponding path program 1 times [2025-02-07 17:13:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206935767] [2025-02-07 17:13:12,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:12,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:12,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:12,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:12,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:12,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:12,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206935767] [2025-02-07 17:13:12,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206935767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:12,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626471501] [2025-02-07 17:13:12,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:12,591 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:12,595 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:12,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:12,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:12,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:12,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 17:13:12,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-07 17:13:12,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-07 17:13:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626471501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:12,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:12,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 15 [2025-02-07 17:13:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711807494] [2025-02-07 17:13:12,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 17:13:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 17:13:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:13:12,846 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 17:13:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:13,003 INFO L93 Difference]: Finished difference Result 161 states and 201 transitions. [2025-02-07 17:13:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:13:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2025-02-07 17:13:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:13,004 INFO L225 Difference]: With dead ends: 161 [2025-02-07 17:13:13,004 INFO L226 Difference]: Without dead ends: 111 [2025-02-07 17:13:13,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-02-07 17:13:13,005 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:13,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-07 17:13:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2025-02-07 17:13:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 86 states have internal predecessors, (107), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-07 17:13:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2025-02-07 17:13:13,018 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 56 [2025-02-07 17:13:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2025-02-07 17:13:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 17:13:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2025-02-07 17:13:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:13,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:13,025 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:13,219 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:13,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:13,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1116082542, now seen corresponding path program 1 times [2025-02-07 17:13:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028167524] [2025-02-07 17:13:13,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:13,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:13,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:13,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:13,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028167524] [2025-02-07 17:13:13,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028167524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:13,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434687042] [2025-02-07 17:13:13,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:13,307 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:13,310 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:13,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:13,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:13,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:13,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:13,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:13:13,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-07 17:13:13,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:13:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434687042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:13,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:13:13,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-07 17:13:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541337178] [2025-02-07 17:13:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:13,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:13,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:13:13,383 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:13,397 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-02-07 17:13:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-02-07 17:13:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:13,398 INFO L225 Difference]: With dead ends: 151 [2025-02-07 17:13:13,398 INFO L226 Difference]: Without dead ends: 108 [2025-02-07 17:13:13,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:13:13,399 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:13,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-07 17:13:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-07 17:13:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.206896551724138) internal successors, (105), 86 states have internal predecessors, (105), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-07 17:13:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2025-02-07 17:13:13,411 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 56 [2025-02-07 17:13:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:13,411 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2025-02-07 17:13:13,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2025-02-07 17:13:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:13,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:13,412 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:13,418 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:13,616 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:13,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:13,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash -736153068, now seen corresponding path program 1 times [2025-02-07 17:13:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:13,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-02-07 17:13:13,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:13,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-02-07 17:13:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521167517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327185015] [2025-02-07 17:13:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:13,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:13,665 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:13,666 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:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:13,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:13,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:13,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:13,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:13:13,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-07 17:13:13,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:13:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327185015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:13:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-07 17:13:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405663389] [2025-02-07 17:13:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:13,730 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:13,745 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2025-02-07 17:13:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-02-07 17:13:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:13,746 INFO L225 Difference]: With dead ends: 164 [2025-02-07 17:13:13,746 INFO L226 Difference]: Without dead ends: 100 [2025-02-07 17:13:13,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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:13:13,747 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:13,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-07 17:13:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-07 17:13:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-07 17:13:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2025-02-07 17:13:13,756 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 56 [2025-02-07 17:13:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:13,757 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2025-02-07 17:13:13,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:13:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2025-02-07 17:13:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:13,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:13,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:13,763 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:13,958 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:13,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash -154468525, now seen corresponding path program 1 times [2025-02-07 17:13:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-02-07 17:13:13,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:13,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:13,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:13,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-02-07 17:13:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144618966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549712996] [2025-02-07 17:13:14,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:14,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:14,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:14,063 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:14,064 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:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 17:13:14,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 17:13:14,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-07 17:13:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549712996] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:14,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 16 [2025-02-07 17:13:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127416041] [2025-02-07 17:13:14,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:13:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:14,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:13:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:13:14,328 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 17:13:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:14,597 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2025-02-07 17:13:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 17:13:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2025-02-07 17:13:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:14,599 INFO L225 Difference]: With dead ends: 199 [2025-02-07 17:13:14,599 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 17:13:14,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-02-07 17:13:14,600 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:14,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 282 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:13:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 17:13:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 100. [2025-02-07 17:13:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 80 states have internal predecessors, (95), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-07 17:13:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2025-02-07 17:13:14,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 56 [2025-02-07 17:13:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:14,633 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2025-02-07 17:13:14,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 17:13:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2025-02-07 17:13:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:14,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:14,634 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:14,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:14,835 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:14,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:14,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -998940396, now seen corresponding path program 1 times [2025-02-07 17:13:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954649528] [2025-02-07 17:13:14,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:13:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954649528] [2025-02-07 17:13:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954649528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:14,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868273013] [2025-02-07 17:13:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:14,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:14,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:14,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:14,879 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:14,897 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2025-02-07 17:13:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:14,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-02-07 17:13:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:14,898 INFO L225 Difference]: With dead ends: 145 [2025-02-07 17:13:14,899 INFO L226 Difference]: Without dead ends: 100 [2025-02-07 17:13:14,899 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:13:14,900 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:14,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-07 17:13:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-07 17:13:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 80 states have internal predecessors, (94), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-07 17:13:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-02-07 17:13:14,913 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 56 [2025-02-07 17:13:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:14,913 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-02-07 17:13:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-02-07 17:13:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 17:13:14,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:14,914 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:14,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 17:13:14,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:14,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 508611413, now seen corresponding path program 1 times [2025-02-07 17:13:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-02-07 17:13:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:14,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:14,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 17:13:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-02-07 17:13:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942919008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056918264] [2025-02-07 17:13:15,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:15,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:15,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:15,127 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:15,128 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:15,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 17:13:15,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 17:13:15,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:15,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:15,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-07 17:13:15,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-07 17:13:15,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 17:13:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056918264] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:15,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:15,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2025-02-07 17:13:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285854770] [2025-02-07 17:13:15,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 17:13:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:15,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 17:13:15,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-02-07 17:13:15,487 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-07 17:13:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:15,796 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2025-02-07 17:13:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 17:13:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2025-02-07 17:13:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:15,798 INFO L225 Difference]: With dead ends: 205 [2025-02-07 17:13:15,798 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 17:13:15,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:13:15,799 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:15,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 224 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:13:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 17:13:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2025-02-07 17:13:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 103 states have internal predecessors, (121), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-07 17:13:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2025-02-07 17:13:15,814 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 56 [2025-02-07 17:13:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:15,814 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2025-02-07 17:13:15,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-07 17:13:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2025-02-07 17:13:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-07 17:13:15,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:15,815 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:15,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 17:13:16,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:16,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash -170858407, now seen corresponding path program 4 times [2025-02-07 17:13:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933643222] [2025-02-07 17:13:16,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:16,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-02-07 17:13:16,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 57 statements. [2025-02-07 17:13:16,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:13:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 17:13:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933643222] [2025-02-07 17:13:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933643222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706396763] [2025-02-07 17:13:16,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:16,093 INFO L229 MonitoredProcess]: Starting monitored process 10 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,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:13:16,132 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-02-07 17:13:16,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 57 statements. [2025-02-07 17:13:16,146 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:13:16,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:16,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:13:16,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:13:16,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 17:13:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706396763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:16,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-07 17:13:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429638577] [2025-02-07 17:13:16,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:13:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:16,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:13:16,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:13:16,279 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 17:13:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:16,402 INFO L93 Difference]: Finished difference Result 217 states and 254 transitions. [2025-02-07 17:13:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 17:13:16,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 57 [2025-02-07 17:13:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:16,404 INFO L225 Difference]: With dead ends: 217 [2025-02-07 17:13:16,405 INFO L226 Difference]: Without dead ends: 138 [2025-02-07 17:13:16,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:13:16,406 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:16,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 223 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-07 17:13:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-02-07 17:13:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.146788990825688) internal successors, (125), 108 states have internal predecessors, (125), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-07 17:13:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2025-02-07 17:13:16,433 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 57 [2025-02-07 17:13:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:16,433 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2025-02-07 17:13:16,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 17:13:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2025-02-07 17:13:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-07 17:13:16,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:16,434 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:16,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 17:13:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1938948679, now seen corresponding path program 5 times [2025-02-07 17:13:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295382288] [2025-02-07 17:13:16,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:13:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:16,644 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 7 equivalence classes. [2025-02-07 17:13:16,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 57 statements. [2025-02-07 17:13:16,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:13:16,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-07 17:13:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:16,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295382288] [2025-02-07 17:13:16,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295382288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001529019] [2025-02-07 17:13:16,721 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:13:16,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:16,723 INFO L229 MonitoredProcess]: Starting monitored process 11 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,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 17:13:16,767 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 7 equivalence classes. [2025-02-07 17:13:16,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 57 statements. [2025-02-07 17:13:16,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:13:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:16,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:13:16,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-07 17:13:16,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-07 17:13:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001529019] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:16,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-07 17:13:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563971182] [2025-02-07 17:13:16,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:16,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 17:13:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:16,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 17:13:16,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-07 17:13:16,857 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 17:13:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:16,985 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2025-02-07 17:13:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:13:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 57 [2025-02-07 17:13:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:16,987 INFO L225 Difference]: With dead ends: 171 [2025-02-07 17:13:16,987 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 17:13:16,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:13:16,987 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:16,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 260 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 17:13:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2025-02-07 17:13:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.11) internal successors, (111), 98 states have internal predecessors, (111), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-07 17:13:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2025-02-07 17:13:16,999 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 57 [2025-02-07 17:13:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2025-02-07 17:13:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-07 17:13:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2025-02-07 17:13:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:13:17,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:17,000 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-07 17:13:17,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:17,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 17:13:17,204 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:17,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1999181687, now seen corresponding path program 6 times [2025-02-07 17:13:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212061173] [2025-02-07 17:13:17,205 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:13:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:17,211 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-02-07 17:13:17,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:13:17,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-07 17:13:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-07 17:13:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212061173] [2025-02-07 17:13:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212061173] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864917654] [2025-02-07 17:13:17,334 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:13:17,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:17,336 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:13:17,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-02-07 17:13:17,755 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:13:17,755 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-07 17:13:17,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:17,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:13:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-07 17:13:17,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-07 17:13:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864917654] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:17,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-07 17:13:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197235469] [2025-02-07 17:13:17,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:17,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 17:13:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:17,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 17:13:17,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-02-07 17:13:17,885 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:18,019 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2025-02-07 17:13:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:13:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-07 17:13:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:18,020 INFO L225 Difference]: With dead ends: 189 [2025-02-07 17:13:18,020 INFO L226 Difference]: Without dead ends: 142 [2025-02-07 17:13:18,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:13:18,021 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:18,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 227 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-07 17:13:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-02-07 17:13:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 108 states have internal predecessors, (123), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-07 17:13:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2025-02-07 17:13:18,036 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 60 [2025-02-07 17:13:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2025-02-07 17:13:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 17:13:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2025-02-07 17:13:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 17:13:18,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:18,038 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 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, 1, 1, 1] [2025-02-07 17:13:18,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:13:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 17:13:18,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2097179737, now seen corresponding path program 7 times [2025-02-07 17:13:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106743586] [2025-02-07 17:13:18,240 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:13:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:18,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:13:18,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:13:18,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:18,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130419796] [2025-02-07 17:13:18,262 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:13:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:18,264 INFO L229 MonitoredProcess]: Starting monitored process 13 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:18,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:13:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:13:18,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:13:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:18,835 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 162 conjuncts are in the unsatisfiable core [2025-02-07 17:13:18,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:18,890 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:18,922 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:18,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:18,957 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:19,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,056 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:19,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 40 treesize of output 48 [2025-02-07 17:13:19,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 case distinctions, treesize of input 47 treesize of output 58 [2025-02-07 17:13:19,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-02-07 17:13:19,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-02-07 17:13:19,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:19,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-02-07 17:13:20,740 INFO L349 Elim1Store]: treesize reduction 468, result has 33.4 percent of original size [2025-02-07 17:13:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 36 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 171 case distinctions, treesize of input 144 treesize of output 302 [2025-02-07 17:13:29,368 INFO L349 Elim1Store]: treesize reduction 480, result has 26.3 percent of original size [2025-02-07 17:13:29,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 859 treesize of output 815 [2025-02-07 17:13:36,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,859 INFO L349 Elim1Store]: treesize reduction 174, result has 0.6 percent of original size [2025-02-07 17:13:36,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 11 select indices, 11 select index equivalence classes, 49 disjoint index pairs (out of 55 index pairs), introduced 13 new quantified variables, introduced 12 case distinctions, treesize of input 141 treesize of output 210 [2025-02-07 17:13:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:36,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:36,943 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:13:36,967 INFO L349 Elim1Store]: treesize reduction 36, result has 43.8 percent of original size [2025-02-07 17:13:36,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 66 [2025-02-07 17:13:41,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:41,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 381 treesize of output 173 [2025-02-07 17:13:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 11 proven. 148 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:13:41,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:48,678 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:14:25,681 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 58 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:14:32,591 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:14:40,128 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 60 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)