./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label02.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 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:56:05,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:56:05,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:56:05,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:56:05,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:56:06,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:56:06,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:56:06,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:56:06,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:56:06,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:56:06,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:56:06,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:56:06,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:56:06,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:56:06,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:56:06,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:56:06,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:56:06,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:56:06,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:56:06,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:56:06,007 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 -> 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 [2025-02-05 11:56:06,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:56:06,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:56:06,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:56:06,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:56:06,283 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:56:06,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2025-02-05 11:56:07,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b6e38dd/0151775085f348edb242a90ac51b81a6/FLAGe1e1c01dc [2025-02-05 11:56:07,984 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:56:07,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2025-02-05 11:56:07,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b6e38dd/0151775085f348edb242a90ac51b81a6/FLAGe1e1c01dc [2025-02-05 11:56:08,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b6e38dd/0151775085f348edb242a90ac51b81a6 [2025-02-05 11:56:08,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:56:08,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:56:08,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:56:08,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:56:08,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:56:08,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08, skipping insertion in model container [2025-02-05 11:56:08,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:56:08,223 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/eca-rers2012/Problem16_label02.c[6387,6400] [2025-02-05 11:56:08,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:08,492 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:56:08,510 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/eca-rers2012/Problem16_label02.c[6387,6400] [2025-02-05 11:56:08,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:08,615 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:56:08,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08 WrapperNode [2025-02-05 11:56:08,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:56:08,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:08,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:56:08,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:56:08,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,724 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:56:08,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:08,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:56:08,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:56:08,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:56:08,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:56:08,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:56:08,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:56:08,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:56:08,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:56:08,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (1/1) ... [2025-02-05 11:56:08,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:56:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:08,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:56:08,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:56:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:56:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:56:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:56:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:56:09,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:56:09,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:56:10,650 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:56:10,726 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:56:10,726 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:56:10,743 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:56:10,743 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:56:10,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:10 BoogieIcfgContainer [2025-02-05 11:56:10,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:56:10,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:56:10,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:56:10,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:56:10,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:56:08" (1/3) ... [2025-02-05 11:56:10,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2617163c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:10, skipping insertion in model container [2025-02-05 11:56:10,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:08" (2/3) ... [2025-02-05 11:56:10,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2617163c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:10, skipping insertion in model container [2025-02-05 11:56:10,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:10" (3/3) ... [2025-02-05 11:56:10,754 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label02.c [2025-02-05 11:56:10,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:56:10,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label02.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:56:10,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:56:10,834 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;@77859727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:56:10,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:56:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 11:56:10,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:10,847 INFO L218 NwaCegarLoop]: trace histogram [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, 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-05 11:56:10,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1049035368, now seen corresponding path program 1 times [2025-02-05 11:56:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156701179] [2025-02-05 11:56:10,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:10,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 11:56:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 11:56:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156701179] [2025-02-05 11:56:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156701179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:11,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61069278] [2025-02-05 11:56:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:11,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:11,183 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:12,545 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-02-05 11:56:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 11:56:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:12,555 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 11:56:12,555 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 11:56:12,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:12,562 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 323 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:12,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 11:56:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 11:56:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-02-05 11:56:12,620 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 61 [2025-02-05 11:56:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-02-05 11:56:12,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-02-05 11:56:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 11:56:12,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:12,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:56:12,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1095122378, now seen corresponding path program 1 times [2025-02-05 11:56:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618494894] [2025-02-05 11:56:12,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:12,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 11:56:12,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 11:56:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618494894] [2025-02-05 11:56:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618494894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706211371] [2025-02-05 11:56:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:12,819 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:13,854 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-02-05 11:56:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-02-05 11:56:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:13,859 INFO L225 Difference]: With dead ends: 1980 [2025-02-05 11:56:13,860 INFO L226 Difference]: Without dead ends: 1320 [2025-02-05 11:56:13,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:13,863 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 294 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:13,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 217 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:56:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-02-05 11:56:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-02-05 11:56:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4564063684609552) internal successors, (1921), 1319 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1921 transitions. [2025-02-05 11:56:13,896 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1921 transitions. Word has length 127 [2025-02-05 11:56:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:13,896 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1921 transitions. [2025-02-05 11:56:13,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1921 transitions. [2025-02-05 11:56:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 11:56:13,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:13,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 11:56:13,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:56:13,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:13,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash 343550329, now seen corresponding path program 1 times [2025-02-05 11:56:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:13,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329197956] [2025-02-05 11:56:13,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 11:56:13,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 11:56:13,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:13,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329197956] [2025-02-05 11:56:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329197956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218237421] [2025-02-05 11:56:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:56:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:56:14,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:56:14,138 INFO L87 Difference]: Start difference. First operand 1320 states and 1921 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:15,733 INFO L93 Difference]: Finished difference Result 4283 states and 6147 transitions. [2025-02-05 11:56:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:56:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-02-05 11:56:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:15,741 INFO L225 Difference]: With dead ends: 4283 [2025-02-05 11:56:15,742 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 11:56:15,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 11:56:15,744 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 885 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:15,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 151 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:56:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 11:56:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-02-05 11:56:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3670715249662617) internal successors, (4052), 2964 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions. [2025-02-05 11:56:15,789 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 140 [2025-02-05 11:56:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:15,789 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions. [2025-02-05 11:56:15,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions. [2025-02-05 11:56:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 11:56:15,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:15,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:15,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:56:15,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:15,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1930200268, now seen corresponding path program 1 times [2025-02-05 11:56:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696935279] [2025-02-05 11:56:15,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:15,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 11:56:15,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 11:56:15,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:56:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696935279] [2025-02-05 11:56:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696935279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483859878] [2025-02-05 11:56:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:15,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:15,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:16,000 INFO L87 Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:17,003 INFO L93 Difference]: Finished difference Result 8231 states and 11469 transitions. [2025-02-05 11:56:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2025-02-05 11:56:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:17,017 INFO L225 Difference]: With dead ends: 8231 [2025-02-05 11:56:17,017 INFO L226 Difference]: Without dead ends: 5597 [2025-02-05 11:56:17,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:17,020 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:17,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:56:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-02-05 11:56:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4939. [2025-02-05 11:56:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.3021466180639936) internal successors, (6430), 4938 states have internal predecessors, (6430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 6430 transitions. [2025-02-05 11:56:17,085 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 6430 transitions. Word has length 227 [2025-02-05 11:56:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:17,085 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 6430 transitions. [2025-02-05 11:56:17,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 6430 transitions. [2025-02-05 11:56:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-05 11:56:17,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:17,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-05 11:56:17,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:56:17,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:17,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -856502758, now seen corresponding path program 1 times [2025-02-05 11:56:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:17,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808147282] [2025-02-05 11:56:17,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:17,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-05 11:56:17,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-05 11:56:17,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:17,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 11:56:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:17,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808147282] [2025-02-05 11:56:17,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808147282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:17,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:17,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828627790] [2025-02-05 11:56:17,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:17,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:56:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:17,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:56:17,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:56:17,514 INFO L87 Difference]: Start difference. First operand 4939 states and 6430 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:18,487 INFO L93 Difference]: Finished difference Result 9547 states and 12517 transitions. [2025-02-05 11:56:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:56:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2025-02-05 11:56:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:18,499 INFO L225 Difference]: With dead ends: 9547 [2025-02-05 11:56:18,499 INFO L226 Difference]: Without dead ends: 4939 [2025-02-05 11:56:18,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 11:56:18,504 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:56:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-02-05 11:56:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-02-05 11:56:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.300931551235318) internal successors, (6424), 4938 states have internal predecessors, (6424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 6424 transitions. [2025-02-05 11:56:18,576 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 6424 transitions. Word has length 319 [2025-02-05 11:56:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:18,576 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 6424 transitions. [2025-02-05 11:56:18,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 6424 transitions. [2025-02-05 11:56:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 11:56:18,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:18,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-05 11:56:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:56:18,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1562333311, now seen corresponding path program 1 times [2025-02-05 11:56:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701338734] [2025-02-05 11:56:18,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:18,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 11:56:18,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 11:56:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 11:56:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:18,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701338734] [2025-02-05 11:56:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701338734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024196196] [2025-02-05 11:56:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:18,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:18,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:18,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:18,792 INFO L87 Difference]: Start difference. First operand 4939 states and 6424 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:19,815 INFO L93 Difference]: Finished difference Result 10205 states and 13271 transitions. [2025-02-05 11:56:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 406 [2025-02-05 11:56:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:19,826 INFO L225 Difference]: With dead ends: 10205 [2025-02-05 11:56:19,826 INFO L226 Difference]: Without dead ends: 4939 [2025-02-05 11:56:19,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:19,834 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 233 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:19,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 538 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:56:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-02-05 11:56:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4610. [2025-02-05 11:56:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.080277717509221) internal successors, (4979), 4609 states have internal predecessors, (4979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4979 transitions. [2025-02-05 11:56:19,885 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4979 transitions. Word has length 406 [2025-02-05 11:56:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:19,885 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4979 transitions. [2025-02-05 11:56:19,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4979 transitions. [2025-02-05 11:56:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 11:56:19,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:19,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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-05 11:56:19,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:56:19,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:19,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 705665972, now seen corresponding path program 1 times [2025-02-05 11:56:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:19,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337973190] [2025-02-05 11:56:19,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:19,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 11:56:19,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 11:56:19,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 117 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337973190] [2025-02-05 11:56:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337973190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410362374] [2025-02-05 11:56:20,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:20,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:20,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:56:20,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 11:56:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 11:56:20,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:20,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:20,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:56:20,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410362374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:56:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153947442] [2025-02-05 11:56:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:20,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:20,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:20,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:20,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:20,663 INFO L87 Difference]: Start difference. First operand 4610 states and 4979 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:21,318 INFO L93 Difference]: Finished difference Result 9876 states and 10691 transitions. [2025-02-05 11:56:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-02-05 11:56:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:21,329 INFO L225 Difference]: With dead ends: 9876 [2025-02-05 11:56:21,329 INFO L226 Difference]: Without dead ends: 5597 [2025-02-05 11:56:21,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:21,333 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:21,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 33 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-02-05 11:56:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-02-05 11:56:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0645103645461043) internal successors, (5957), 5596 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5957 transitions. [2025-02-05 11:56:21,385 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5957 transitions. Word has length 411 [2025-02-05 11:56:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:21,385 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5957 transitions. [2025-02-05 11:56:21,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5957 transitions. [2025-02-05 11:56:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 11:56:21,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:21,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:21,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:56:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:21,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2137795332, now seen corresponding path program 1 times [2025-02-05 11:56:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933836735] [2025-02-05 11:56:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:21,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 11:56:21,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 11:56:21,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:21,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-05 11:56:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933836735] [2025-02-05 11:56:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933836735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477243529] [2025-02-05 11:56:22,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:22,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:22,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:22,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:56:22,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 11:56:22,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 11:56:22,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:22,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:56:22,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-05 11:56:22,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-05 11:56:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477243529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:25,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-05 11:56:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810109582] [2025-02-05 11:56:25,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:25,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 11:56:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:25,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 11:56:25,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:56:25,708 INFO L87 Difference]: Start difference. First operand 5597 states and 5957 transitions. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:28,528 INFO L93 Difference]: Finished difference Result 18759 states and 20015 transitions. [2025-02-05 11:56:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 11:56:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 475 [2025-02-05 11:56:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:28,548 INFO L225 Difference]: With dead ends: 18759 [2025-02-05 11:56:28,548 INFO L226 Difference]: Without dead ends: 12506 [2025-02-05 11:56:28,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:56:28,554 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1307 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:28,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 44 Invalid, 4683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:56:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-02-05 11:56:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12177. [2025-02-05 11:56:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0596254927726676) internal successors, (12902), 12176 states have internal predecessors, (12902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12902 transitions. [2025-02-05 11:56:28,656 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12902 transitions. Word has length 475 [2025-02-05 11:56:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12902 transitions. [2025-02-05 11:56:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12902 transitions. [2025-02-05 11:56:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-02-05 11:56:28,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:28,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-05 11:56:28,667 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-05 11:56:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:28,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash -428250467, now seen corresponding path program 1 times [2025-02-05 11:56:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488788817] [2025-02-05 11:56:28,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-02-05 11:56:28,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-02-05 11:56:28,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:28,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 11:56:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488788817] [2025-02-05 11:56:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488788817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178541240] [2025-02-05 11:56:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:29,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:29,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:29,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:29,135 INFO L87 Difference]: Start difference. First operand 12177 states and 12902 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:29,822 INFO L93 Difference]: Finished difference Result 29287 states and 31147 transitions. [2025-02-05 11:56:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:29,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 562 [2025-02-05 11:56:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:29,846 INFO L225 Difference]: With dead ends: 29287 [2025-02-05 11:56:29,846 INFO L226 Difference]: Without dead ends: 17112 [2025-02-05 11:56:29,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:29,857 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:29,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 449 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-02-05 11:56:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 14809. [2025-02-05 11:56:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0497703943814154) internal successors, (15545), 14808 states have internal predecessors, (15545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15545 transitions. [2025-02-05 11:56:30,042 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15545 transitions. Word has length 562 [2025-02-05 11:56:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:30,042 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15545 transitions. [2025-02-05 11:56:30,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15545 transitions. [2025-02-05 11:56:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 11:56:30,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:30,050 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:56:30,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1812608081, now seen corresponding path program 1 times [2025-02-05 11:56:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34906312] [2025-02-05 11:56:30,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:30,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 11:56:30,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 11:56:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-02-05 11:56:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34906312] [2025-02-05 11:56:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34906312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:30,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:30,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891208287] [2025-02-05 11:56:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:30,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:30,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:30,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:30,449 INFO L87 Difference]: Start difference. First operand 14809 states and 15545 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:31,069 INFO L93 Difference]: Finished difference Result 33235 states and 34959 transitions. [2025-02-05 11:56:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 698 [2025-02-05 11:56:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:31,092 INFO L225 Difference]: With dead ends: 33235 [2025-02-05 11:56:31,092 INFO L226 Difference]: Without dead ends: 18757 [2025-02-05 11:56:31,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:31,104 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 225 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:31,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 44 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-02-05 11:56:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18099. [2025-02-05 11:56:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0503923085423803) internal successors, (19010), 18098 states have internal predecessors, (19010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 19010 transitions. [2025-02-05 11:56:31,255 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 19010 transitions. Word has length 698 [2025-02-05 11:56:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:31,256 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 19010 transitions. [2025-02-05 11:56:31,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 19010 transitions. [2025-02-05 11:56:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-02-05 11:56:31,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:31,263 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:56:31,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:31,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1820956660, now seen corresponding path program 1 times [2025-02-05 11:56:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802842815] [2025-02-05 11:56:31,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:31,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-02-05 11:56:31,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-02-05 11:56:31,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-02-05 11:56:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802842815] [2025-02-05 11:56:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802842815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601028053] [2025-02-05 11:56:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:31,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:31,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:31,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:31,568 INFO L87 Difference]: Start difference. First operand 18099 states and 19010 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:32,252 INFO L93 Difference]: Finished difference Result 39157 states and 41224 transitions. [2025-02-05 11:56:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 722 [2025-02-05 11:56:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:32,278 INFO L225 Difference]: With dead ends: 39157 [2025-02-05 11:56:32,278 INFO L226 Difference]: Without dead ends: 21060 [2025-02-05 11:56:32,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:32,292 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 225 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:32,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 446 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-02-05 11:56:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20731. [2025-02-05 11:56:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.0455378678244092) internal successors, (21674), 20730 states have internal predecessors, (21674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21674 transitions. [2025-02-05 11:56:32,542 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21674 transitions. Word has length 722 [2025-02-05 11:56:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:32,543 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21674 transitions. [2025-02-05 11:56:32,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21674 transitions. [2025-02-05 11:56:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-02-05 11:56:32,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:32,554 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:32,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:56:32,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:32,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash -616469314, now seen corresponding path program 1 times [2025-02-05 11:56:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021436539] [2025-02-05 11:56:32,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-02-05 11:56:32,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-02-05 11:56:32,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:32,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-02-05 11:56:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021436539] [2025-02-05 11:56:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021436539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:33,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:56:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689871962] [2025-02-05 11:56:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:56:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:33,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:56:33,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:56:33,244 INFO L87 Difference]: Start difference. First operand 20731 states and 21674 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:34,017 INFO L93 Difference]: Finished difference Result 21391 states and 22342 transitions. [2025-02-05 11:56:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:56:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 722 [2025-02-05 11:56:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:34,035 INFO L225 Difference]: With dead ends: 21391 [2025-02-05 11:56:34,035 INFO L226 Difference]: Without dead ends: 21060 [2025-02-05 11:56:34,037 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-05 11:56:34,039 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 504 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:34,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 17 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-02-05 11:56:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20731. [2025-02-05 11:56:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.0453449107573565) internal successors, (21670), 20730 states have internal predecessors, (21670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21670 transitions. [2025-02-05 11:56:34,193 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21670 transitions. Word has length 722 [2025-02-05 11:56:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21670 transitions. [2025-02-05 11:56:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21670 transitions. [2025-02-05 11:56:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-02-05 11:56:34,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:34,202 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-02-05 11:56:34,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:56:34,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1157384066, now seen corresponding path program 1 times [2025-02-05 11:56:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94702540] [2025-02-05 11:56:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:34,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-02-05 11:56:34,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-02-05 11:56:34,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 118 proven. 542 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 11:56:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94702540] [2025-02-05 11:56:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94702540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490366623] [2025-02-05 11:56:34,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:34,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:34,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:34,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:56:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-02-05 11:56:35,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-02-05 11:56:35,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:35,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:35,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-02-05 11:56:35,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490366623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:56:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055794674] [2025-02-05 11:56:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:35,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:35,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:35,116 INFO L87 Difference]: Start difference. First operand 20731 states and 21670 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:35,719 INFO L93 Difference]: Finished difference Result 41131 states and 43007 transitions. [2025-02-05 11:56:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:35,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 821 [2025-02-05 11:56:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:35,736 INFO L225 Difference]: With dead ends: 41131 [2025-02-05 11:56:35,736 INFO L226 Difference]: Without dead ends: 20731 [2025-02-05 11:56:35,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 821 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:35,749 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 306 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:35,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 381 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:56:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-02-05 11:56:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 20402. [2025-02-05 11:56:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0399980393117985) internal successors, (21217), 20401 states have internal predecessors, (21217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 21217 transitions. [2025-02-05 11:56:35,972 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 21217 transitions. Word has length 821 [2025-02-05 11:56:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:35,973 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 21217 transitions. [2025-02-05 11:56:35,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 21217 transitions. [2025-02-05 11:56:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-02-05 11:56:35,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:35,988 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:56:35,995 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-05 11:56:36,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:36,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:36,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1883083558, now seen corresponding path program 1 times [2025-02-05 11:56:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:36,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069541792] [2025-02-05 11:56:36,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-02-05 11:56:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-02-05 11:56:36,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:36,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 941 proven. 100 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-05 11:56:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069541792] [2025-02-05 11:56:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069541792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959691543] [2025-02-05 11:56:36,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:36,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:36,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:56:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-02-05 11:56:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-02-05 11:56:37,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:37,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 11:56:37,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 249 proven. 851 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 11:56:38,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 308 proven. 792 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 11:56:40,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959691543] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:40,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2025-02-05 11:56:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708070142] [2025-02-05 11:56:40,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:40,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:56:40,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:40,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:56:40,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:56:40,434 INFO L87 Difference]: Start difference. First operand 20402 states and 21217 transitions. Second operand has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:45,836 INFO L93 Difference]: Finished difference Result 49700 states and 51594 transitions. [2025-02-05 11:56:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 11:56:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 869 [2025-02-05 11:56:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:45,859 INFO L225 Difference]: With dead ends: 49700 [2025-02-05 11:56:45,859 INFO L226 Difference]: Without dead ends: 28971 [2025-02-05 11:56:45,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1752 GetRequests, 1729 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-02-05 11:56:45,869 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4188 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11078 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4188 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 11078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:45,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4188 Valid, 118 Invalid, 11739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 11078 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-05 11:56:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28971 states. [2025-02-05 11:56:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28971 to 24679. [2025-02-05 11:56:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24679 states, 24678 states have (on average 1.0362265985898371) internal successors, (25572), 24678 states have internal predecessors, (25572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24679 states to 24679 states and 25572 transitions. [2025-02-05 11:56:46,131 INFO L78 Accepts]: Start accepts. Automaton has 24679 states and 25572 transitions. Word has length 869 [2025-02-05 11:56:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:46,132 INFO L471 AbstractCegarLoop]: Abstraction has 24679 states and 25572 transitions. [2025-02-05 11:56:46,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24679 states and 25572 transitions. [2025-02-05 11:56:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2025-02-05 11:56:46,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:46,143 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:56:46,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 11:56:46,344 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,SelfDestructingSolverStorable13 [2025-02-05 11:56:46,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:46,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 513119733, now seen corresponding path program 1 times [2025-02-05 11:56:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518425770] [2025-02-05 11:56:46,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:46,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 971 statements into 1 equivalence classes. [2025-02-05 11:56:46,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 971 of 971 statements. [2025-02-05 11:56:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 1294 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-02-05 11:56:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518425770] [2025-02-05 11:56:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518425770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215389467] [2025-02-05 11:56:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:46,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:46,942 INFO L87 Difference]: Start difference. First operand 24679 states and 25572 transitions. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:47,585 INFO L93 Difference]: Finished difference Result 48698 states and 50468 transitions. [2025-02-05 11:56:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 971 [2025-02-05 11:56:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:47,603 INFO L225 Difference]: With dead ends: 48698 [2025-02-05 11:56:47,603 INFO L226 Difference]: Without dead ends: 24350 [2025-02-05 11:56:47,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:47,609 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:47,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 433 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:56:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2025-02-05 11:56:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 23692. [2025-02-05 11:56:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23692 states, 23691 states have (on average 1.0296737157570386) internal successors, (24394), 23691 states have internal predecessors, (24394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23692 states to 23692 states and 24394 transitions. [2025-02-05 11:56:47,769 INFO L78 Accepts]: Start accepts. Automaton has 23692 states and 24394 transitions. Word has length 971 [2025-02-05 11:56:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 23692 states and 24394 transitions. [2025-02-05 11:56:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 23692 states and 24394 transitions. [2025-02-05 11:56:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2025-02-05 11:56:47,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:47,780 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 11:56:47,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:56:47,780 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:47,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1548290453, now seen corresponding path program 1 times [2025-02-05 11:56:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426946969] [2025-02-05 11:56:47,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:47,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1009 statements into 1 equivalence classes. [2025-02-05 11:56:47,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1009 of 1009 statements. [2025-02-05 11:56:47,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-02-05 11:56:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426946969] [2025-02-05 11:56:48,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426946969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993799588] [2025-02-05 11:56:48,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:48,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:48,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:48,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:56:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1009 statements into 1 equivalence classes. [2025-02-05 11:56:48,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1009 of 1009 statements. [2025-02-05 11:56:48,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:48,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:48,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 11:56:48,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-02-05 11:56:49,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-02-05 11:56:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993799588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:51,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:51,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-05 11:56:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970531330] [2025-02-05 11:56:51,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:51,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:56:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:51,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:56:51,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:56:51,196 INFO L87 Difference]: Start difference. First operand 23692 states and 24394 transitions. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:52,962 INFO L93 Difference]: Finished difference Result 47382 states and 48792 transitions. [2025-02-05 11:56:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 11:56:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1009 [2025-02-05 11:56:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:52,984 INFO L225 Difference]: With dead ends: 47382 [2025-02-05 11:56:52,984 INFO L226 Difference]: Without dead ends: 24021 [2025-02-05 11:56:52,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2023 GetRequests, 2016 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:56:52,997 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 988 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3794 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:52,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 129 Invalid, 3860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:56:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-02-05 11:56:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 22705. [2025-02-05 11:56:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22705 states, 22704 states have (on average 1.025369978858351) internal successors, (23280), 22704 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22705 states to 22705 states and 23280 transitions. [2025-02-05 11:56:53,177 INFO L78 Accepts]: Start accepts. Automaton has 22705 states and 23280 transitions. Word has length 1009 [2025-02-05 11:56:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:53,177 INFO L471 AbstractCegarLoop]: Abstraction has 22705 states and 23280 transitions. [2025-02-05 11:56:53,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 22705 states and 23280 transitions. [2025-02-05 11:56:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2025-02-05 11:56:53,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:53,197 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:53,204 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-05 11:56:53,397 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,SelfDestructingSolverStorable15 [2025-02-05 11:56:53,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:53,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1307453072, now seen corresponding path program 1 times [2025-02-05 11:56:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331021898] [2025-02-05 11:56:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:53,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1342 statements into 1 equivalence classes. [2025-02-05 11:56:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1342 of 1342 statements. [2025-02-05 11:56:53,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4072 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2025-02-05 11:56:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331021898] [2025-02-05 11:56:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331021898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111820405] [2025-02-05 11:56:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:53,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:53,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:53,927 INFO L87 Difference]: Start difference. First operand 22705 states and 23280 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:54,498 INFO L93 Difference]: Finished difference Result 47711 states and 48937 transitions. [2025-02-05 11:56:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1342 [2025-02-05 11:56:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:54,517 INFO L225 Difference]: With dead ends: 47711 [2025-02-05 11:56:54,517 INFO L226 Difference]: Without dead ends: 22705 [2025-02-05 11:56:54,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:54,531 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 146 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:54,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 422 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:56:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-02-05 11:56:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 21389. [2025-02-05 11:56:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21389 states, 21388 states have (on average 1.021133345801384) internal successors, (21840), 21388 states have internal predecessors, (21840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 21840 transitions. [2025-02-05 11:56:54,683 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 21840 transitions. Word has length 1342 [2025-02-05 11:56:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 21389 states and 21840 transitions. [2025-02-05 11:56:54,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 21840 transitions. [2025-02-05 11:56:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2025-02-05 11:56:54,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:54,699 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:56:54,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:54,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash 447668143, now seen corresponding path program 1 times [2025-02-05 11:56:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556324323] [2025-02-05 11:56:54,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:54,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1358 statements into 1 equivalence classes. [2025-02-05 11:56:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1358 of 1358 statements. [2025-02-05 11:56:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3363 backedges. 1375 proven. 1583 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-02-05 11:56:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556324323] [2025-02-05 11:56:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556324323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781911759] [2025-02-05 11:56:56,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:56,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:56,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:56:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1358 statements into 1 equivalence classes. [2025-02-05 11:56:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1358 of 1358 statements. [2025-02-05 11:56:56,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:56,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:56,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:56:56,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3363 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 1915 trivial. 0 not checked. [2025-02-05 11:56:57,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781911759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:57,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 11:56:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479948572] [2025-02-05 11:56:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:57,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:57,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:57,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:56:57,369 INFO L87 Difference]: Start difference. First operand 21389 states and 21840 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:57,940 INFO L93 Difference]: Finished difference Result 42447 states and 43347 transitions. [2025-02-05 11:56:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:57,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1358 [2025-02-05 11:56:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:57,957 INFO L225 Difference]: With dead ends: 42447 [2025-02-05 11:56:57,957 INFO L226 Difference]: Without dead ends: 21389 [2025-02-05 11:56:57,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1366 GetRequests, 1358 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:56:57,969 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 72 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:57,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 435 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:56:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-02-05 11:56:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 21389. [2025-02-05 11:56:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21389 states, 21388 states have (on average 1.0189826070693846) internal successors, (21794), 21388 states have internal predecessors, (21794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 21794 transitions. [2025-02-05 11:56:58,116 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 21794 transitions. Word has length 1358 [2025-02-05 11:56:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:58,116 INFO L471 AbstractCegarLoop]: Abstraction has 21389 states and 21794 transitions. [2025-02-05 11:56:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 21794 transitions. [2025-02-05 11:56:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2025-02-05 11:56:58,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:58,133 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 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, 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-05 11:56:58,140 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-05 11:56:58,334 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,SelfDestructingSolverStorable17 [2025-02-05 11:56:58,334 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:58,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1861382410, now seen corresponding path program 1 times [2025-02-05 11:56:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411259736] [2025-02-05 11:56:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:58,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1498 statements into 1 equivalence classes. [2025-02-05 11:56:58,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1498 of 1498 statements. [2025-02-05 11:56:58,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:58,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3992 backedges. 2661 proven. 0 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-02-05 11:56:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:58,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411259736] [2025-02-05 11:56:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411259736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718813403] [2025-02-05 11:56:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:58,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:58,953 INFO L87 Difference]: Start difference. First operand 21389 states and 21794 transitions. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:59,557 INFO L93 Difference]: Finished difference Result 42447 states and 43249 transitions. [2025-02-05 11:56:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1498 [2025-02-05 11:56:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:59,577 INFO L225 Difference]: With dead ends: 42447 [2025-02-05 11:56:59,577 INFO L226 Difference]: Without dead ends: 21060 [2025-02-05 11:56:59,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:59,589 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:59,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:56:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-02-05 11:56:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19744. [2025-02-05 11:56:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0149420047611812) internal successors, (20038), 19743 states have internal predecessors, (20038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20038 transitions. [2025-02-05 11:56:59,731 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20038 transitions. Word has length 1498 [2025-02-05 11:56:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:59,732 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20038 transitions. [2025-02-05 11:56:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20038 transitions. [2025-02-05 11:56:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1557 [2025-02-05 11:56:59,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:59,749 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-05 11:56:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:56:59,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 233591913, now seen corresponding path program 1 times [2025-02-05 11:56:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130092766] [2025-02-05 11:56:59,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:59,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1556 statements into 1 equivalence classes. [2025-02-05 11:56:59,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1556 of 1556 statements. [2025-02-05 11:56:59,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:59,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2813 proven. 35 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-02-05 11:57:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130092766] [2025-02-05 11:57:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130092766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472160452] [2025-02-05 11:57:00,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:00,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:00,947 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-05 11:57:00,947 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-05 11:57:01,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1556 statements into 1 equivalence classes. [2025-02-05 11:57:01,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1556 of 1556 statements. [2025-02-05 11:57:01,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:01,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:01,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 11:57:01,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2813 proven. 35 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-02-05 11:57:02,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:57:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2526 proven. 322 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-02-05 11:57:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472160452] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:57:05,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:57:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-05 11:57:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869716639] [2025-02-05 11:57:05,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:57:05,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:57:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:05,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:57:05,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:05,249 INFO L87 Difference]: Start difference. First operand 19744 states and 20038 transitions. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:06,931 INFO L93 Difference]: Finished difference Result 39486 states and 40079 transitions. [2025-02-05 11:57:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:57:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1556 [2025-02-05 11:57:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:06,947 INFO L225 Difference]: With dead ends: 39486 [2025-02-05 11:57:06,947 INFO L226 Difference]: Without dead ends: 20073 [2025-02-05 11:57:06,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3119 GetRequests, 3113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:57:06,956 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 306 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4107 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:06,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 571 Invalid, 4127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4107 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:57:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-02-05 11:57:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20073. [2025-02-05 11:57:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0145974491829415) internal successors, (20365), 20072 states have internal predecessors, (20365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20365 transitions. [2025-02-05 11:57:07,091 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20365 transitions. Word has length 1556 [2025-02-05 11:57:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20365 transitions. [2025-02-05 11:57:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20365 transitions. [2025-02-05 11:57:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1588 [2025-02-05 11:57:07,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:07,110 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-05 11:57:07,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:57:07,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:07,311 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:07,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837589, now seen corresponding path program 1 times [2025-02-05 11:57:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:07,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486954222] [2025-02-05 11:57:07,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:07,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1587 statements into 1 equivalence classes. [2025-02-05 11:57:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1587 of 1587 statements. [2025-02-05 11:57:07,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:07,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2642 proven. 237 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-02-05 11:57:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486954222] [2025-02-05 11:57:09,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486954222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965651759] [2025-02-05 11:57:09,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:09,438 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-05 11:57:09,438 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-05 11:57:09,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1587 statements into 1 equivalence classes. [2025-02-05 11:57:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1587 of 1587 statements. [2025-02-05 11:57:09,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:09,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:09,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 11:57:09,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2677 proven. 464 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-02-05 11:57:10,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:57:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2677 proven. 464 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-02-05 11:57:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965651759] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:57:12,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:57:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2025-02-05 11:57:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484423919] [2025-02-05 11:57:12,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:57:12,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:57:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:57:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:57:12,061 INFO L87 Difference]: Start difference. First operand 20073 states and 20365 transitions. Second operand has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:18,202 INFO L93 Difference]: Finished difference Result 41854 states and 42466 transitions. [2025-02-05 11:57:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 11:57:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1587 [2025-02-05 11:57:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:18,222 INFO L225 Difference]: With dead ends: 41854 [2025-02-05 11:57:18,222 INFO L226 Difference]: Without dead ends: 21782 [2025-02-05 11:57:18,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3202 GetRequests, 3176 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-02-05 11:57:18,236 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 2427 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 19194 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 19387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 19194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 289 Invalid, 19387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 19194 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-05 11:57:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21782 states. [2025-02-05 11:57:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21782 to 20731. [2025-02-05 11:57:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.013603473227207) internal successors, (21012), 20730 states have internal predecessors, (21012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21012 transitions. [2025-02-05 11:57:18,376 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21012 transitions. Word has length 1587 [2025-02-05 11:57:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21012 transitions. [2025-02-05 11:57:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21012 transitions. [2025-02-05 11:57:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2299 [2025-02-05 11:57:18,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:18,443 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:18,450 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-05 11:57:18,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:18,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:18,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1571604963, now seen corresponding path program 1 times [2025-02-05 11:57:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114624066] [2025-02-05 11:57:18,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:18,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2298 statements into 1 equivalence classes. [2025-02-05 11:57:18,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2298 of 2298 statements. [2025-02-05 11:57:18,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10334 backedges. 6203 proven. 0 refuted. 0 times theorem prover too weak. 4131 trivial. 0 not checked. [2025-02-05 11:57:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114624066] [2025-02-05 11:57:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114624066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:20,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:20,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586909202] [2025-02-05 11:57:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:20,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:20,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:20,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:20,413 INFO L87 Difference]: Start difference. First operand 20731 states and 21012 transitions. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:20,980 INFO L93 Difference]: Finished difference Result 41460 states and 42025 transitions. [2025-02-05 11:57:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2298 [2025-02-05 11:57:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:20,999 INFO L225 Difference]: With dead ends: 41460 [2025-02-05 11:57:20,999 INFO L226 Difference]: Without dead ends: 21060 [2025-02-05 11:57:21,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:21,013 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 434 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:57:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-02-05 11:57:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20402. [2025-02-05 11:57:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0137738346159502) internal successors, (20682), 20401 states have internal predecessors, (20682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20682 transitions. [2025-02-05 11:57:21,242 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20682 transitions. Word has length 2298 [2025-02-05 11:57:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20682 transitions. [2025-02-05 11:57:21,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20682 transitions. [2025-02-05 11:57:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2370 [2025-02-05 11:57:21,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:21,300 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 11:57:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:57:21,301 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1645214613, now seen corresponding path program 1 times [2025-02-05 11:57:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721635693] [2025-02-05 11:57:21,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:21,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2369 statements into 1 equivalence classes. [2025-02-05 11:57:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2369 of 2369 statements. [2025-02-05 11:57:21,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:21,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10949 backedges. 7885 proven. 978 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2025-02-05 11:57:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721635693] [2025-02-05 11:57:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721635693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500771324] [2025-02-05 11:57:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:24,458 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-05 11:57:24,459 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-05 11:57:24,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2369 statements into 1 equivalence classes. [2025-02-05 11:57:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2369 of 2369 statements. [2025-02-05 11:57:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:24,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:57:24,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10949 backedges. 3942 proven. 0 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2025-02-05 11:57:24,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:57:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500771324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:24,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:57:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 11:57:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412384537] [2025-02-05 11:57:24,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:24,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:24,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:57:24,969 INFO L87 Difference]: Start difference. First operand 20402 states and 20682 transitions. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:25,513 INFO L93 Difference]: Finished difference Result 42118 states and 42701 transitions. [2025-02-05 11:57:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2369 [2025-02-05 11:57:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:25,532 INFO L225 Difference]: With dead ends: 42118 [2025-02-05 11:57:25,532 INFO L226 Difference]: Without dead ends: 22047 [2025-02-05 11:57:25,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2375 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:57:25,542 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 198 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:25,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 422 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:57:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22047 states. [2025-02-05 11:57:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22047 to 20073. [2025-02-05 11:57:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.01404942208051) internal successors, (20354), 20072 states have internal predecessors, (20354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20354 transitions. [2025-02-05 11:57:25,744 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20354 transitions. Word has length 2369 [2025-02-05 11:57:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20354 transitions. [2025-02-05 11:57:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20354 transitions. [2025-02-05 11:57:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2417 [2025-02-05 11:57:25,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:25,774 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 11:57:25,782 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-05 11:57:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:25,975 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1450282285, now seen corresponding path program 1 times [2025-02-05 11:57:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631937844] [2025-02-05 11:57:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:26,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2416 statements into 1 equivalence classes. [2025-02-05 11:57:26,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2416 of 2416 statements. [2025-02-05 11:57:26,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 6955 proven. 0 refuted. 0 times theorem prover too weak. 4277 trivial. 0 not checked. [2025-02-05 11:57:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631937844] [2025-02-05 11:57:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631937844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:28,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:28,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:57:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720911636] [2025-02-05 11:57:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:57:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:28,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:57:28,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:57:28,401 INFO L87 Difference]: Start difference. First operand 20073 states and 20354 transitions. Second operand has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:29,121 INFO L93 Difference]: Finished difference Result 39826 states and 40386 transitions. [2025-02-05 11:57:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:57:29,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2416 [2025-02-05 11:57:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:29,136 INFO L225 Difference]: With dead ends: 39826 [2025-02-05 11:57:29,136 INFO L226 Difference]: Without dead ends: 20084 [2025-02-05 11:57:29,145 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-05 11:57:29,145 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:29,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 438 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20084 states. [2025-02-05 11:57:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20084 to 19744. [2025-02-05 11:57:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0136250823076534) internal successors, (20012), 19743 states have internal predecessors, (20012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20012 transitions. [2025-02-05 11:57:29,279 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20012 transitions. Word has length 2416 [2025-02-05 11:57:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:29,280 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20012 transitions. [2025-02-05 11:57:29,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20012 transitions. [2025-02-05 11:57:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2487 [2025-02-05 11:57:29,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:29,309 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:29,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:57:29,309 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash 480177066, now seen corresponding path program 1 times [2025-02-05 11:57:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623847598] [2025-02-05 11:57:29,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:29,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2486 statements into 1 equivalence classes. [2025-02-05 11:57:29,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2486 of 2486 statements. [2025-02-05 11:57:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat