./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i -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 32cc6da12107835fbba84157088ec5af8a04f69b7f7a6f7a2a92488ba931be42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:01:21,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:01:21,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:01:21,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:01:21,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:01:21,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:01:21,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:01:21,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:01:21,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:01:21,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:01:21,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:01:21,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:01:21,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:01:21,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:01:21,078 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:01:21,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:01:21,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:21,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:01:21,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:01:21,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:01:21,080 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 -> 32cc6da12107835fbba84157088ec5af8a04f69b7f7a6f7a2a92488ba931be42 [2025-02-05 22:01:21,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:01:21,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:01:21,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:01:21,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:01:21,298 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:01:21,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i [2025-02-05 22:01:22,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b98235818/89377e5d71074c768cbb49b55204dda6/FLAG939b52747 [2025-02-05 22:01:22,971 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:01:22,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i [2025-02-05 22:01:22,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b98235818/89377e5d71074c768cbb49b55204dda6/FLAG939b52747 [2025-02-05 22:01:23,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b98235818/89377e5d71074c768cbb49b55204dda6 [2025-02-05 22:01:23,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:01:23,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:01:23,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:23,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:01:23,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:01:23,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23, skipping insertion in model container [2025-02-05 22:01:23,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:01:23,294 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i[916,929] [2025-02-05 22:01:23,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:23,488 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:01:23,496 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-79.i[916,929] [2025-02-05 22:01:23,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:23,564 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:01:23,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23 WrapperNode [2025-02-05 22:01:23,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:23,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:23,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:01:23,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:01:23,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,632 INFO L138 Inliner]: procedures = 26, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 814 [2025-02-05 22:01:23,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:23,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:01:23,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:01:23,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:01:23,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,693 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 22:01:23,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:01:23,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:01:23,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:01:23,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:01:23,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (1/1) ... [2025-02-05 22:01:23,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:23,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:01:23,766 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 22:01:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:01:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:01:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:01:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:01:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:01:23,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:01:23,893 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:01:23,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:01:24,704 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:01:24,704 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:01:24,722 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:01:24,723 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:01:24,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:24 BoogieIcfgContainer [2025-02-05 22:01:24,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:01:24,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:01:24,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:01:24,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:01:24,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:01:23" (1/3) ... [2025-02-05 22:01:24,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761033bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:24, skipping insertion in model container [2025-02-05 22:01:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:23" (2/3) ... [2025-02-05 22:01:24,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761033bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:24, skipping insertion in model container [2025-02-05 22:01:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:24" (3/3) ... [2025-02-05 22:01:24,735 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-79.i [2025-02-05 22:01:24,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:01:24,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-79.i that has 2 procedures, 339 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:01:24,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:01:24,793 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;@47ae0460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:01:24,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:01:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 339 states, 214 states have (on average 1.5373831775700935) internal successors, (329), 215 states have internal predecessors, (329), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-05 22:01:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2025-02-05 22:01:24,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:24,825 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:24,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:24,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 501596923, now seen corresponding path program 1 times [2025-02-05 22:01:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130362708] [2025-02-05 22:01:24,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:24,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-02-05 22:01:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-02-05 22:01:25,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:25,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-02-05 22:01:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130362708] [2025-02-05 22:01:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130362708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:01:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300222261] [2025-02-05 22:01:25,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:01:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:25,509 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 22:01:25,513 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 22:01:25,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-02-05 22:01:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-02-05 22:01:25,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:25,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:25,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:01:25,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:01:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-02-05 22:01:25,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:01:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300222261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:01:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:01:25,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128524390] [2025-02-05 22:01:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:01:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:26,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:01:26,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:01:26,027 INFO L87 Difference]: Start difference. First operand has 339 states, 214 states have (on average 1.5373831775700935) internal successors, (329), 215 states have internal predecessors, (329), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-02-05 22:01:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:26,095 INFO L93 Difference]: Finished difference Result 672 states and 1263 transitions. [2025-02-05 22:01:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:01:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) Word has length 771 [2025-02-05 22:01:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:26,107 INFO L225 Difference]: With dead ends: 672 [2025-02-05 22:01:26,107 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 22:01:26,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:01:26,119 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:26,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 22:01:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-05 22:01:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 212 states have (on average 1.5141509433962264) internal successors, (321), 212 states have internal predecessors, (321), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-05 22:01:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 565 transitions. [2025-02-05 22:01:26,193 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 565 transitions. Word has length 771 [2025-02-05 22:01:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:26,194 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 565 transitions. [2025-02-05 22:01:26,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-02-05 22:01:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 565 transitions. [2025-02-05 22:01:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2025-02-05 22:01:26,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:26,220 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:26,235 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 22:01:26,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:01:26,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:26,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 316410600, now seen corresponding path program 1 times [2025-02-05 22:01:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677192370] [2025-02-05 22:01:26,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:26,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 772 statements into 1 equivalence classes. [2025-02-05 22:01:26,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 772 of 772 statements. [2025-02-05 22:01:26,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:26,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677192370] [2025-02-05 22:01:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677192370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:27,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:27,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153872483] [2025-02-05 22:01:27,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:27,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:27,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:27,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:27,283 INFO L87 Difference]: Start difference. First operand 336 states and 565 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:27,373 INFO L93 Difference]: Finished difference Result 837 states and 1408 transitions. [2025-02-05 22:01:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 772 [2025-02-05 22:01:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:27,384 INFO L225 Difference]: With dead ends: 837 [2025-02-05 22:01:27,385 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 22:01:27,386 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 22:01:27,386 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 269 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:27,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 22:01:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2025-02-05 22:01:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 335 states have (on average 1.5432835820895523) internal successors, (517), 336 states have internal predecessors, (517), 163 states have call successors, (163), 2 states have call predecessors, (163), 2 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-02-05 22:01:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 843 transitions. [2025-02-05 22:01:27,495 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 843 transitions. Word has length 772 [2025-02-05 22:01:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:27,497 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 843 transitions. [2025-02-05 22:01:27,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 843 transitions. [2025-02-05 22:01:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2025-02-05 22:01:27,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:27,517 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:27,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:01:27,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 18133167, now seen corresponding path program 1 times [2025-02-05 22:01:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880754074] [2025-02-05 22:01:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:27,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-02-05 22:01:27,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-02-05 22:01:27,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:27,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880754074] [2025-02-05 22:01:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880754074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387242935] [2025-02-05 22:01:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:28,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:28,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:28,238 INFO L87 Difference]: Start difference. First operand 501 states and 843 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:28,340 INFO L93 Difference]: Finished difference Result 1497 states and 2523 transitions. [2025-02-05 22:01:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 773 [2025-02-05 22:01:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:28,352 INFO L225 Difference]: With dead ends: 1497 [2025-02-05 22:01:28,352 INFO L226 Difference]: Without dead ends: 999 [2025-02-05 22:01:28,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:28,354 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 350 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:28,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1294 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-02-05 22:01:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 996. [2025-02-05 22:01:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 665 states have (on average 1.544360902255639) internal successors, (1027), 667 states have internal predecessors, (1027), 326 states have call successors, (326), 4 states have call predecessors, (326), 4 states have return successors, (326), 324 states have call predecessors, (326), 326 states have call successors, (326) [2025-02-05 22:01:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1679 transitions. [2025-02-05 22:01:28,510 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1679 transitions. Word has length 773 [2025-02-05 22:01:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1679 transitions. [2025-02-05 22:01:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1679 transitions. [2025-02-05 22:01:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-02-05 22:01:28,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:28,516 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:01:28,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -838782593, now seen corresponding path program 1 times [2025-02-05 22:01:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13688827] [2025-02-05 22:01:28,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:28,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-02-05 22:01:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-02-05 22:01:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13688827] [2025-02-05 22:01:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13688827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24544285] [2025-02-05 22:01:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:28,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:28,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:28,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:28,779 INFO L87 Difference]: Start difference. First operand 996 states and 1679 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:28,858 INFO L93 Difference]: Finished difference Result 1945 states and 3271 transitions. [2025-02-05 22:01:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 774 [2025-02-05 22:01:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:28,866 INFO L225 Difference]: With dead ends: 1945 [2025-02-05 22:01:28,866 INFO L226 Difference]: Without dead ends: 1447 [2025-02-05 22:01:28,867 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 22:01:28,868 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 342 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:28,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1231 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-02-05 22:01:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1443. [2025-02-05 22:01:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 977 states have (on average 1.5475946775844422) internal successors, (1512), 982 states have internal predecessors, (1512), 457 states have call successors, (457), 8 states have call predecessors, (457), 8 states have return successors, (457), 452 states have call predecessors, (457), 457 states have call successors, (457) [2025-02-05 22:01:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2426 transitions. [2025-02-05 22:01:28,960 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2426 transitions. Word has length 774 [2025-02-05 22:01:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2426 transitions. [2025-02-05 22:01:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2426 transitions. [2025-02-05 22:01:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-02-05 22:01:28,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:28,986 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:01:28,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1620032915, now seen corresponding path program 1 times [2025-02-05 22:01:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969861986] [2025-02-05 22:01:28,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:29,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-02-05 22:01:29,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-02-05 22:01:29,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:29,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:29,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:29,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969861986] [2025-02-05 22:01:29,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969861986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:29,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:29,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:29,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406472301] [2025-02-05 22:01:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:29,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:29,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:29,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:29,721 INFO L87 Difference]: Start difference. First operand 1443 states and 2426 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:29,899 INFO L93 Difference]: Finished difference Result 4163 states and 7018 transitions. [2025-02-05 22:01:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:29,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 774 [2025-02-05 22:01:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:29,919 INFO L225 Difference]: With dead ends: 4163 [2025-02-05 22:01:29,919 INFO L226 Difference]: Without dead ends: 2800 [2025-02-05 22:01:29,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 22:01:29,923 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 301 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:29,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1104 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2025-02-05 22:01:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2798. [2025-02-05 22:01:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 1913 states have (on average 1.5436487192890747) internal successors, (2953), 1922 states have internal predecessors, (2953), 869 states have call successors, (869), 15 states have call predecessors, (869), 15 states have return successors, (869), 860 states have call predecessors, (869), 869 states have call successors, (869) [2025-02-05 22:01:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4691 transitions. [2025-02-05 22:01:30,147 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4691 transitions. Word has length 774 [2025-02-05 22:01:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4691 transitions. [2025-02-05 22:01:30,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4691 transitions. [2025-02-05 22:01:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-02-05 22:01:30,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:30,154 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:01:30,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -470875826, now seen corresponding path program 1 times [2025-02-05 22:01:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378830351] [2025-02-05 22:01:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:30,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-02-05 22:01:30,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-02-05 22:01:30,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:30,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378830351] [2025-02-05 22:01:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378830351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864769633] [2025-02-05 22:01:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:30,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:30,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:30,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:30,637 INFO L87 Difference]: Start difference. First operand 2798 states and 4691 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:30,902 INFO L93 Difference]: Finished difference Result 8234 states and 13825 transitions. [2025-02-05 22:01:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 774 [2025-02-05 22:01:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:30,932 INFO L225 Difference]: With dead ends: 8234 [2025-02-05 22:01:30,933 INFO L226 Difference]: Without dead ends: 5516 [2025-02-05 22:01:30,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:30,943 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 282 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:30,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1114 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2025-02-05 22:01:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 5514. [2025-02-05 22:01:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 3791 states have (on average 1.5423371142178846) internal successors, (5847), 3808 states have internal predecessors, (5847), 1693 states have call successors, (1693), 29 states have call predecessors, (1693), 29 states have return successors, (1693), 1676 states have call predecessors, (1693), 1693 states have call successors, (1693) [2025-02-05 22:01:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 9233 transitions. [2025-02-05 22:01:31,419 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 9233 transitions. Word has length 774 [2025-02-05 22:01:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:31,422 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 9233 transitions. [2025-02-05 22:01:31,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 9233 transitions. [2025-02-05 22:01:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-02-05 22:01:31,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:31,427 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:31,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:01:31,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:31,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash -870550026, now seen corresponding path program 1 times [2025-02-05 22:01:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:31,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025635666] [2025-02-05 22:01:31,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-02-05 22:01:31,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-02-05 22:01:31,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025635666] [2025-02-05 22:01:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025635666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:01:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684121356] [2025-02-05 22:01:32,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:32,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:01:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:01:32,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:01:32,260 INFO L87 Difference]: Start difference. First operand 5514 states and 9233 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:33,056 INFO L93 Difference]: Finished difference Result 11096 states and 18572 transitions. [2025-02-05 22:01:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:01:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 775 [2025-02-05 22:01:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:33,101 INFO L225 Difference]: With dead ends: 11096 [2025-02-05 22:01:33,101 INFO L226 Difference]: Without dead ends: 5662 [2025-02-05 22:01:33,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:01:33,121 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 492 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:33,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1979 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:01:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2025-02-05 22:01:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5514. [2025-02-05 22:01:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 3791 states have (on average 1.5391717225006594) internal successors, (5835), 3808 states have internal predecessors, (5835), 1693 states have call successors, (1693), 29 states have call predecessors, (1693), 29 states have return successors, (1693), 1676 states have call predecessors, (1693), 1693 states have call successors, (1693) [2025-02-05 22:01:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 9221 transitions. [2025-02-05 22:01:33,644 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 9221 transitions. Word has length 775 [2025-02-05 22:01:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:33,646 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 9221 transitions. [2025-02-05 22:01:33,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 9221 transitions. [2025-02-05 22:01:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2025-02-05 22:01:33,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:33,652 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:33,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:01:33,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1506672688, now seen corresponding path program 1 times [2025-02-05 22:01:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716023651] [2025-02-05 22:01:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:33,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 776 statements into 1 equivalence classes. [2025-02-05 22:01:33,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 776 of 776 statements. [2025-02-05 22:01:33,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:33,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716023651] [2025-02-05 22:01:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716023651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853213209] [2025-02-05 22:01:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:33,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:33,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:33,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:33,991 INFO L87 Difference]: Start difference. First operand 5514 states and 9221 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:34,199 INFO L93 Difference]: Finished difference Result 11068 states and 18534 transitions. [2025-02-05 22:01:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 776 [2025-02-05 22:01:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:34,240 INFO L225 Difference]: With dead ends: 11068 [2025-02-05 22:01:34,242 INFO L226 Difference]: Without dead ends: 5634 [2025-02-05 22:01:34,257 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 22:01:34,258 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 18 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:34,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1127 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states. [2025-02-05 22:01:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 5514. [2025-02-05 22:01:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 3791 states have (on average 1.5328409390662094) internal successors, (5811), 3808 states have internal predecessors, (5811), 1693 states have call successors, (1693), 29 states have call predecessors, (1693), 29 states have return successors, (1693), 1676 states have call predecessors, (1693), 1693 states have call successors, (1693) [2025-02-05 22:01:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 9197 transitions. [2025-02-05 22:01:34,671 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 9197 transitions. Word has length 776 [2025-02-05 22:01:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:34,672 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 9197 transitions. [2025-02-05 22:01:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 9197 transitions. [2025-02-05 22:01:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2025-02-05 22:01:34,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:34,678 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:34,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:01:34,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1377589969, now seen corresponding path program 1 times [2025-02-05 22:01:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631896169] [2025-02-05 22:01:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:34,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 776 statements into 1 equivalence classes. [2025-02-05 22:01:34,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 776 of 776 statements. [2025-02-05 22:01:34,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:34,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631896169] [2025-02-05 22:01:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631896169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:35,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807479594] [2025-02-05 22:01:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:35,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:35,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:35,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:35,255 INFO L87 Difference]: Start difference. First operand 5514 states and 9197 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:35,405 INFO L93 Difference]: Finished difference Result 11044 states and 18342 transitions. [2025-02-05 22:01:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 776 [2025-02-05 22:01:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:35,430 INFO L225 Difference]: With dead ends: 11044 [2025-02-05 22:01:35,430 INFO L226 Difference]: Without dead ends: 5610 [2025-02-05 22:01:35,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 22:01:35,444 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 32 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:35,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1099 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2025-02-05 22:01:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5610. [2025-02-05 22:01:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5610 states, 3863 states have (on average 1.516696867719389) internal successors, (5859), 3880 states have internal predecessors, (5859), 1693 states have call successors, (1693), 53 states have call predecessors, (1693), 53 states have return successors, (1693), 1676 states have call predecessors, (1693), 1693 states have call successors, (1693) [2025-02-05 22:01:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 9245 transitions. [2025-02-05 22:01:35,934 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 9245 transitions. Word has length 776 [2025-02-05 22:01:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:35,935 INFO L471 AbstractCegarLoop]: Abstraction has 5610 states and 9245 transitions. [2025-02-05 22:01:35,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 9245 transitions. [2025-02-05 22:01:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 22:01:35,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:35,944 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:35,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:01:35,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:35,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash -417264012, now seen corresponding path program 1 times [2025-02-05 22:01:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:35,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074044642] [2025-02-05 22:01:35,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:35,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 22:01:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 22:01:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 135 proven. 228 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:01:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074044642] [2025-02-05 22:01:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074044642] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:01:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625249941] [2025-02-05 22:01:36,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:01:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:36,689 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 22:01:36,690 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 22:01:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 22:01:37,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 22:01:37,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:37,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:37,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 22:01:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:01:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 6141 proven. 321 refuted. 0 times theorem prover too weak. 23062 trivial. 0 not checked. [2025-02-05 22:01:39,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:01:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 42 proven. 321 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:01:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625249941] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:01:40,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:01:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-02-05 22:01:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852235855] [2025-02-05 22:01:40,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:01:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:01:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:40,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:01:40,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:01:40,689 INFO L87 Difference]: Start difference. First operand 5610 states and 9245 transitions. Second operand has 17 states, 17 states have (on average 28.941176470588236) internal successors, (492), 17 states have internal predecessors, (492), 5 states have call successors, (351), 3 states have call predecessors, (351), 6 states have return successors, (352), 5 states have call predecessors, (352), 5 states have call successors, (352) [2025-02-05 22:01:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:41,718 INFO L93 Difference]: Finished difference Result 7871 states and 12893 transitions. [2025-02-05 22:01:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 22:01:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 28.941176470588236) internal successors, (492), 17 states have internal predecessors, (492), 5 states have call successors, (351), 3 states have call predecessors, (351), 6 states have return successors, (352), 5 states have call predecessors, (352), 5 states have call successors, (352) Word has length 777 [2025-02-05 22:01:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:41,731 INFO L225 Difference]: With dead ends: 7871 [2025-02-05 22:01:41,732 INFO L226 Difference]: Without dead ends: 2341 [2025-02-05 22:01:41,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1570 GetRequests, 1542 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2025-02-05 22:01:41,745 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 935 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:41,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1602 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:01:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2025-02-05 22:01:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1246. [2025-02-05 22:01:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 779 states have (on average 1.4236200256739409) internal successors, (1109), 782 states have internal predecessors, (1109), 448 states have call successors, (448), 18 states have call predecessors, (448), 18 states have return successors, (448), 445 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-05 22:01:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2005 transitions. [2025-02-05 22:01:41,865 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2005 transitions. Word has length 777 [2025-02-05 22:01:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:41,866 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 2005 transitions. [2025-02-05 22:01:41,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 28.941176470588236) internal successors, (492), 17 states have internal predecessors, (492), 5 states have call successors, (351), 3 states have call predecessors, (351), 6 states have return successors, (352), 5 states have call predecessors, (352), 5 states have call successors, (352) [2025-02-05 22:01:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2005 transitions. [2025-02-05 22:01:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 22:01:41,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:41,872 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:41,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:01:42,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:01:42,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -194124861, now seen corresponding path program 1 times [2025-02-05 22:01:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139279895] [2025-02-05 22:01:42,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:42,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 22:01:42,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 22:01:42,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:42,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139279895] [2025-02-05 22:01:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139279895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472224819] [2025-02-05 22:01:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:42,341 INFO L87 Difference]: Start difference. First operand 1246 states and 2005 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:42,413 INFO L93 Difference]: Finished difference Result 2290 states and 3687 transitions. [2025-02-05 22:01:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:01:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 777 [2025-02-05 22:01:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:42,419 INFO L225 Difference]: With dead ends: 2290 [2025-02-05 22:01:42,419 INFO L226 Difference]: Without dead ends: 1258 [2025-02-05 22:01:42,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:01:42,421 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 293 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:42,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1306 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-02-05 22:01:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1128. [2025-02-05 22:01:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 737 states have (on average 1.4423337856173677) internal successors, (1063), 740 states have internal predecessors, (1063), 371 states have call successors, (371), 19 states have call predecessors, (371), 19 states have return successors, (371), 368 states have call predecessors, (371), 371 states have call successors, (371) [2025-02-05 22:01:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1805 transitions. [2025-02-05 22:01:42,484 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1805 transitions. Word has length 777 [2025-02-05 22:01:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:42,487 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1805 transitions. [2025-02-05 22:01:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1805 transitions. [2025-02-05 22:01:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-02-05 22:01:42,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:42,491 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:01:42,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1005008095, now seen corresponding path program 1 times [2025-02-05 22:01:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692901979] [2025-02-05 22:01:42,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:42,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-02-05 22:01:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-02-05 22:01:42,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692901979] [2025-02-05 22:01:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692901979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:01:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888391547] [2025-02-05 22:01:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:01:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:01:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:01:42,823 INFO L87 Difference]: Start difference. First operand 1128 states and 1805 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:43,657 INFO L93 Difference]: Finished difference Result 5256 states and 8437 transitions. [2025-02-05 22:01:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:01:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 779 [2025-02-05 22:01:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:43,671 INFO L225 Difference]: With dead ends: 5256 [2025-02-05 22:01:43,673 INFO L226 Difference]: Without dead ends: 4216 [2025-02-05 22:01:43,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:01:43,676 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 1488 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:43,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 3813 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:01:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2025-02-05 22:01:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 2406. [2025-02-05 22:01:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1673 states have (on average 1.5140466228332337) internal successors, (2533), 1678 states have internal predecessors, (2533), 697 states have call successors, (697), 35 states have call predecessors, (697), 35 states have return successors, (697), 692 states have call predecessors, (697), 697 states have call successors, (697) [2025-02-05 22:01:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3927 transitions. [2025-02-05 22:01:43,866 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3927 transitions. Word has length 779 [2025-02-05 22:01:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:43,867 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3927 transitions. [2025-02-05 22:01:43,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3927 transitions. [2025-02-05 22:01:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:01:43,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:43,872 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:43,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:01:43,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 391049560, now seen corresponding path program 1 times [2025-02-05 22:01:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537397844] [2025-02-05 22:01:43,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:01:44,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:01:44,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537397844] [2025-02-05 22:01:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537397844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:01:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504550077] [2025-02-05 22:01:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:44,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:01:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:01:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:01:44,616 INFO L87 Difference]: Start difference. First operand 2406 states and 3927 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:47,557 INFO L93 Difference]: Finished difference Result 14122 states and 22475 transitions. [2025-02-05 22:01:47,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:01:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 780 [2025-02-05 22:01:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:47,595 INFO L225 Difference]: With dead ends: 14122 [2025-02-05 22:01:47,595 INFO L226 Difference]: Without dead ends: 11804 [2025-02-05 22:01:47,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:01:47,603 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 1978 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:47,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1978 Valid, 3103 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 22:01:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2025-02-05 22:01:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 10246. [2025-02-05 22:01:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 7613 states have (on average 1.5122816235386838) internal successors, (11513), 7666 states have internal predecessors, (11513), 2429 states have call successors, (2429), 203 states have call predecessors, (2429), 203 states have return successors, (2429), 2376 states have call predecessors, (2429), 2429 states have call successors, (2429) [2025-02-05 22:01:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 16371 transitions. [2025-02-05 22:01:48,455 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 16371 transitions. Word has length 780 [2025-02-05 22:01:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:48,456 INFO L471 AbstractCegarLoop]: Abstraction has 10246 states and 16371 transitions. [2025-02-05 22:01:48,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:01:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 16371 transitions. [2025-02-05 22:01:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:01:48,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:48,469 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:48,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:01:48,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:48,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1876105111, now seen corresponding path program 1 times [2025-02-05 22:01:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627492380] [2025-02-05 22:01:48,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:48,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:01:48,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:01:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:01:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:51,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627492380] [2025-02-05 22:01:51,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627492380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:51,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:51,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:01:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895391412] [2025-02-05 22:01:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:51,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:01:51,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:01:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:01:51,864 INFO L87 Difference]: Start difference. First operand 10246 states and 16371 transitions. Second operand has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 4 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-02-05 22:02:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:01,697 INFO L93 Difference]: Finished difference Result 64978 states and 102629 transitions. [2025-02-05 22:02:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:02:01,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 4 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 780 [2025-02-05 22:02:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:01,841 INFO L225 Difference]: With dead ends: 64978 [2025-02-05 22:02:01,842 INFO L226 Difference]: Without dead ends: 54820 [2025-02-05 22:02:01,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:02:01,866 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 3686 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1265 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:01,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3686 Valid, 2644 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1265 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 22:02:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54820 states. [2025-02-05 22:02:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54820 to 28766. [2025-02-05 22:02:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28766 states, 21437 states have (on average 1.5026822783038671) internal successors, (32213), 21602 states have internal predecessors, (32213), 6721 states have call successors, (6721), 607 states have call predecessors, (6721), 607 states have return successors, (6721), 6556 states have call predecessors, (6721), 6721 states have call successors, (6721) [2025-02-05 22:02:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28766 states to 28766 states and 45655 transitions. [2025-02-05 22:02:05,979 INFO L78 Accepts]: Start accepts. Automaton has 28766 states and 45655 transitions. Word has length 780 [2025-02-05 22:02:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,980 INFO L471 AbstractCegarLoop]: Abstraction has 28766 states and 45655 transitions. [2025-02-05 22:02:05,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 4 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-02-05 22:02:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28766 states and 45655 transitions. [2025-02-05 22:02:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:02:05,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,995 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:05,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:02:05,995 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1799890099, now seen corresponding path program 1 times [2025-02-05 22:02:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634385631] [2025-02-05 22:02:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:06,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:06,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:06,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:06,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:02:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634385631] [2025-02-05 22:02:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634385631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470933487] [2025-02-05 22:02:06,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:06,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:06,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:06,153 INFO L87 Difference]: Start difference. First operand 28766 states and 45655 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:02:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:09,147 INFO L93 Difference]: Finished difference Result 57626 states and 91325 transitions. [2025-02-05 22:02:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:09,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 780 [2025-02-05 22:02:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:09,229 INFO L225 Difference]: With dead ends: 57626 [2025-02-05 22:02:09,230 INFO L226 Difference]: Without dead ends: 28948 [2025-02-05 22:02:09,266 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 22:02:09,267 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 261 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:09,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1230 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28948 states. [2025-02-05 22:02:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28948 to 17014. [2025-02-05 22:02:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17014 states, 12954 states have (on average 1.5408368071638103) internal successors, (19960), 13035 states have internal predecessors, (19960), 3705 states have call successors, (3705), 354 states have call predecessors, (3705), 354 states have return successors, (3705), 3624 states have call predecessors, (3705), 3705 states have call successors, (3705) [2025-02-05 22:02:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17014 states to 17014 states and 27370 transitions. [2025-02-05 22:02:11,658 INFO L78 Accepts]: Start accepts. Automaton has 17014 states and 27370 transitions. Word has length 780 [2025-02-05 22:02:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:11,659 INFO L471 AbstractCegarLoop]: Abstraction has 17014 states and 27370 transitions. [2025-02-05 22:02:11,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:02:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 17014 states and 27370 transitions. [2025-02-05 22:02:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:02:11,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:11,675 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:11,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:02:11,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:11,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:11,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1864618572, now seen corresponding path program 1 times [2025-02-05 22:02:11,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:11,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909488022] [2025-02-05 22:02:11,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:11,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:11,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:11,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-02-05 22:02:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909488022] [2025-02-05 22:02:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909488022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447567772] [2025-02-05 22:02:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:12,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:12,282 INFO L87 Difference]: Start difference. First operand 17014 states and 27370 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:02:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:16,883 INFO L93 Difference]: Finished difference Result 54560 states and 87465 transitions. [2025-02-05 22:02:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:16,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 780 [2025-02-05 22:02:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:17,021 INFO L225 Difference]: With dead ends: 54560 [2025-02-05 22:02:17,022 INFO L226 Difference]: Without dead ends: 37624 [2025-02-05 22:02:17,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 22:02:17,054 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1054 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:17,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1372 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:02:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37624 states. [2025-02-05 22:02:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37624 to 33852. [2025-02-05 22:02:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33852 states, 25656 states have (on average 1.522606797630184) internal successors, (39064), 25817 states have internal predecessors, (39064), 7465 states have call successors, (7465), 730 states have call predecessors, (7465), 730 states have return successors, (7465), 7304 states have call predecessors, (7465), 7465 states have call successors, (7465) [2025-02-05 22:02:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33852 states to 33852 states and 53994 transitions. [2025-02-05 22:02:21,024 INFO L78 Accepts]: Start accepts. Automaton has 33852 states and 53994 transitions. Word has length 780 [2025-02-05 22:02:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:21,025 INFO L471 AbstractCegarLoop]: Abstraction has 33852 states and 53994 transitions. [2025-02-05 22:02:21,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-05 22:02:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33852 states and 53994 transitions. [2025-02-05 22:02:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:02:21,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:21,039 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:02:21,040 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1634256341, now seen corresponding path program 1 times [2025-02-05 22:02:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461709263] [2025-02-05 22:02:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:21,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:21,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:21,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 123 proven. 240 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:02:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461709263] [2025-02-05 22:02:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461709263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611765816] [2025-02-05 22:02:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:21,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:21,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:21,522 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 22:02:21,523 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 22:02:21,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:21,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:21,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:21,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:21,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:02:21,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 7401 proven. 51 refuted. 0 times theorem prover too weak. 22072 trivial. 0 not checked. [2025-02-05 22:02:22,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:02:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 312 proven. 51 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:02:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611765816] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:02:22,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:02:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 22:02:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067058397] [2025-02-05 22:02:22,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:02:22,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:02:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:22,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:02:22,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:22,455 INFO L87 Difference]: Start difference. First operand 33852 states and 53994 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 3 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-02-05 22:02:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:27,103 INFO L93 Difference]: Finished difference Result 67406 states and 106059 transitions. [2025-02-05 22:02:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:02:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 3 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) Word has length 780 [2025-02-05 22:02:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:27,197 INFO L225 Difference]: With dead ends: 67406 [2025-02-05 22:02:27,197 INFO L226 Difference]: Without dead ends: 33632 [2025-02-05 22:02:27,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1573 GetRequests, 1557 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:02:27,240 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 776 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:27,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 989 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:02:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33632 states. [2025-02-05 22:02:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33632 to 31868. [2025-02-05 22:02:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31868 states, 23616 states have (on average 1.4744241192411924) internal successors, (34820), 23777 states have internal predecessors, (34820), 7465 states have call successors, (7465), 786 states have call predecessors, (7465), 786 states have return successors, (7465), 7304 states have call predecessors, (7465), 7465 states have call successors, (7465) [2025-02-05 22:02:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31868 states to 31868 states and 49750 transitions. [2025-02-05 22:02:31,556 INFO L78 Accepts]: Start accepts. Automaton has 31868 states and 49750 transitions. Word has length 780 [2025-02-05 22:02:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:31,557 INFO L471 AbstractCegarLoop]: Abstraction has 31868 states and 49750 transitions. [2025-02-05 22:02:31,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 3 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-02-05 22:02:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 31868 states and 49750 transitions. [2025-02-05 22:02:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:02:31,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:31,571 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:31,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 22:02:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:31,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:31,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1884149699, now seen corresponding path program 1 times [2025-02-05 22:02:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324956016] [2025-02-05 22:02:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:32,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:32,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 306 proven. 57 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:02:32,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:32,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324956016] [2025-02-05 22:02:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324956016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:32,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506810767] [2025-02-05 22:02:32,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:32,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:32,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:32,289 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 22:02:32,291 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 22:02:32,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:32,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:32,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:32,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:02:32,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 8077 proven. 57 refuted. 0 times theorem prover too weak. 21390 trivial. 0 not checked. [2025-02-05 22:02:32,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:02:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 306 proven. 57 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:02:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506810767] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:02:33,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:02:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 22:02:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038945372] [2025-02-05 22:02:33,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:02:33,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:02:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:33,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:02:33,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:02:33,257 INFO L87 Difference]: Start difference. First operand 31868 states and 49750 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 2 states have call predecessors, (142), 2 states have call successors, (142) [2025-02-05 22:02:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:35,873 INFO L93 Difference]: Finished difference Result 48516 states and 75315 transitions. [2025-02-05 22:02:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:02:35,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 2 states have call predecessors, (142), 2 states have call successors, (142) Word has length 780 [2025-02-05 22:02:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:35,945 INFO L225 Difference]: With dead ends: 48516 [2025-02-05 22:02:35,945 INFO L226 Difference]: Without dead ends: 16726 [2025-02-05 22:02:36,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1567 GetRequests, 1557 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:02:36,024 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 352 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 993 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16726 states. [2025-02-05 22:02:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16726 to 14938. [2025-02-05 22:02:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14938 states, 10786 states have (on average 1.4177637678472093) internal successors, (15292), 10867 states have internal predecessors, (15292), 3753 states have call successors, (3753), 398 states have call predecessors, (3753), 398 states have return successors, (3753), 3672 states have call predecessors, (3753), 3753 states have call successors, (3753) [2025-02-05 22:02:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14938 states to 14938 states and 22798 transitions. [2025-02-05 22:02:38,155 INFO L78 Accepts]: Start accepts. Automaton has 14938 states and 22798 transitions. Word has length 780 [2025-02-05 22:02:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:38,155 INFO L471 AbstractCegarLoop]: Abstraction has 14938 states and 22798 transitions. [2025-02-05 22:02:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 2 states have call predecessors, (142), 2 states have call successors, (142) [2025-02-05 22:02:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14938 states and 22798 transitions. [2025-02-05 22:02:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-02-05 22:02:38,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:38,167 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:38,176 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 22:02:38,367 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,SelfDestructingSolverStorable17 [2025-02-05 22:02:38,368 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 735856796, now seen corresponding path program 1 times [2025-02-05 22:02:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361124334] [2025-02-05 22:02:38,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:38,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:38,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:38,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:38,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 504 proven. 216 refuted. 0 times theorem prover too weak. 28804 trivial. 0 not checked. [2025-02-05 22:02:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:38,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361124334] [2025-02-05 22:02:38,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361124334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:38,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712398021] [2025-02-05 22:02:38,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:38,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:38,956 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 22:02:38,957 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 22:02:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-02-05 22:02:39,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-02-05 22:02:39,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:39,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:39,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1748 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 22:02:39,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 8721 proven. 63 refuted. 0 times theorem prover too weak. 20740 trivial. 0 not checked. [2025-02-05 22:02:40,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:02:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 300 proven. 63 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-02-05 22:02:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712398021] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:02:41,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:02:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 22 [2025-02-05 22:02:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055570902] [2025-02-05 22:02:41,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:02:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 22:02:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:41,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 22:02:41,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:02:41,238 INFO L87 Difference]: Start difference. First operand 14938 states and 22798 transitions. Second operand has 22 states, 22 states have (on average 17.863636363636363) internal successors, (393), 22 states have internal predecessors, (393), 6 states have call successors, (283), 3 states have call predecessors, (283), 6 states have return successors, (284), 6 states have call predecessors, (284), 6 states have call successors, (284)