./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.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-250_file-29.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 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:34:00,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:34:00,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:34:00,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:34:00,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:34:00,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:34:00,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:34:00,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:34:00,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:34:00,540 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:34:00,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:34:00,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:34:00,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:34:00,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:34:00,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:34:00,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:00,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:34:00,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:34:00,544 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 -> 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f [2025-02-05 21:34:00,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:34:00,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:34:00,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:34:00,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:34:00,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:34:00,758 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-250_file-29.i [2025-02-05 21:34:02,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c881b310/4d6dca8a704b4afe826be793ec99bae8/FLAGce367e4c0 [2025-02-05 21:34:02,441 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:34:02,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-02-05 21:34:02,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c881b310/4d6dca8a704b4afe826be793ec99bae8/FLAGce367e4c0 [2025-02-05 21:34:02,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c881b310/4d6dca8a704b4afe826be793ec99bae8 [2025-02-05 21:34:02,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:34:02,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:34:02,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:02,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:34:02,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:34:02,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13855e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02, skipping insertion in model container [2025-02-05 21:34:02,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:34:02,639 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-250_file-29.i[916,929] [2025-02-05 21:34:02,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:02,756 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:34:02,764 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-250_file-29.i[916,929] [2025-02-05 21:34:02,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:02,818 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:34:02,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02 WrapperNode [2025-02-05 21:34:02,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:02,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:02,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:34:02,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:34:02,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,914 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-02-05 21:34:02,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:02,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:34:02,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:34:02,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:34:02,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,977 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 21:34:02,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:02,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:03,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:03,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:03,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:03,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:34:03,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:34:03,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:34:03,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:34:03,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (1/1) ... [2025-02-05 21:34:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:03,056 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 21:34:03,059 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 21:34:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:34:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:34:03,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:34:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:34:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:34:03,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:34:03,211 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:34:03,213 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:34:03,715 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 21:34:03,715 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:34:03,735 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:34:03,735 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:34:03,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:03 BoogieIcfgContainer [2025-02-05 21:34:03,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:34:03,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:34:03,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:34:03,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:34:03,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:34:02" (1/3) ... [2025-02-05 21:34:03,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52370b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:03, skipping insertion in model container [2025-02-05 21:34:03,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:02" (2/3) ... [2025-02-05 21:34:03,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52370b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:03, skipping insertion in model container [2025-02-05 21:34:03,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:03" (3/3) ... [2025-02-05 21:34:03,743 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-02-05 21:34:03,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:34:03,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:34:03,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:34:03,804 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;@455a65bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:34:03,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:34:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-05 21:34:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:03,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:03,823 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:03,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:03,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:03,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2137676269, now seen corresponding path program 1 times [2025-02-05 21:34:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436257697] [2025-02-05 21:34:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:03,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:03,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:03,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-02-05 21:34:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436257697] [2025-02-05 21:34:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436257697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:34:04,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77633596] [2025-02-05 21:34:04,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:04,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:34:04,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:04,221 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 21:34:04,223 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 21:34:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:04,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:04,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:04,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:04,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:34:04,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:34:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-02-05 21:34:04,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:34:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77633596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:34:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:34:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877597994] [2025-02-05 21:34:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:04,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:34:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:34:04,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:34:04,575 INFO L87 Difference]: Start difference. First operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:04,637 INFO L93 Difference]: Finished difference Result 450 states and 837 transitions. [2025-02-05 21:34:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:34:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-02-05 21:34:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:04,644 INFO L225 Difference]: With dead ends: 450 [2025-02-05 21:34:04,644 INFO L226 Difference]: Without dead ends: 225 [2025-02-05 21:34:04,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 472 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 21:34:04,649 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:04,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-05 21:34:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-05 21:34:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 147 states have (on average 1.530612244897959) internal successors, (225), 147 states have internal predecessors, (225), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-05 21:34:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 377 transitions. [2025-02-05 21:34:04,701 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 377 transitions. Word has length 471 [2025-02-05 21:34:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:04,702 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 377 transitions. [2025-02-05 21:34:04,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 377 transitions. [2025-02-05 21:34:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:04,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:04,712 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:04,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:34:04,913 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 21:34:04,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:04,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -405518471, now seen corresponding path program 1 times [2025-02-05 21:34:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:04,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719372719] [2025-02-05 21:34:04,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:04,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:04,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719372719] [2025-02-05 21:34:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719372719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251537471] [2025-02-05 21:34:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:05,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:05,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:05,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:05,298 INFO L87 Difference]: Start difference. First operand 225 states and 377 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:05,402 INFO L93 Difference]: Finished difference Result 579 states and 974 transitions. [2025-02-05 21:34:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:05,411 INFO L225 Difference]: With dead ends: 579 [2025-02-05 21:34:05,411 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 21:34:05,412 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 21:34:05,415 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 229 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:05,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 794 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 21:34:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-02-05 21:34:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:34:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 594 transitions. [2025-02-05 21:34:05,462 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 594 transitions. Word has length 471 [2025-02-05 21:34:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:05,466 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 594 transitions. [2025-02-05 21:34:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 594 transitions. [2025-02-05 21:34:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:05,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:05,471 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:05,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:34:05,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash -281445224, now seen corresponding path program 1 times [2025-02-05 21:34:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18657940] [2025-02-05 21:34:05,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:05,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:05,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:05,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18657940] [2025-02-05 21:34:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18657940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:05,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:05,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177573039] [2025-02-05 21:34:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:05,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:05,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:05,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:05,799 INFO L87 Difference]: Start difference. First operand 354 states and 594 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:05,885 INFO L93 Difference]: Finished difference Result 716 states and 1198 transitions. [2025-02-05 21:34:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:05,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:05,889 INFO L225 Difference]: With dead ends: 716 [2025-02-05 21:34:05,891 INFO L226 Difference]: Without dead ends: 365 [2025-02-05 21:34:05,892 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 21:34:05,893 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 195 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:05,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 784 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-05 21:34:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 296. [2025-02-05 21:34:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-05 21:34:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2025-02-05 21:34:05,921 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 471 [2025-02-05 21:34:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:05,924 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2025-02-05 21:34:05,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2025-02-05 21:34:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:05,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:05,931 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:05,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:34:05,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:05,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1071864473, now seen corresponding path program 1 times [2025-02-05 21:34:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405367478] [2025-02-05 21:34:05,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:05,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:06,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405367478] [2025-02-05 21:34:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405367478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:34:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709991725] [2025-02-05 21:34:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:34:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:06,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:34:06,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:34:06,560 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:08,312 INFO L93 Difference]: Finished difference Result 1421 states and 2361 transitions. [2025-02-05 21:34:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:34:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-02-05 21:34:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:08,320 INFO L225 Difference]: With dead ends: 1421 [2025-02-05 21:34:08,323 INFO L226 Difference]: Without dead ends: 1128 [2025-02-05 21:34:08,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:34:08,324 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1622 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:08,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1964 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:34:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-02-05 21:34:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 982. [2025-02-05 21:34:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 725 states have (on average 1.56) internal successors, (1131), 727 states have internal predecessors, (1131), 247 states have call successors, (247), 9 states have call predecessors, (247), 9 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-02-05 21:34:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1625 transitions. [2025-02-05 21:34:08,424 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1625 transitions. Word has length 471 [2025-02-05 21:34:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:08,425 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1625 transitions. [2025-02-05 21:34:08,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1625 transitions. [2025-02-05 21:34:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:08,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:08,431 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:34:08,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:08,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 227392602, now seen corresponding path program 1 times [2025-02-05 21:34:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919814049] [2025-02-05 21:34:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:08,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:08,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:08,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:08,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919814049] [2025-02-05 21:34:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919814049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:08,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160456512] [2025-02-05 21:34:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:08,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:08,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:08,832 INFO L87 Difference]: Start difference. First operand 982 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:08,962 INFO L93 Difference]: Finished difference Result 2940 states and 4869 transitions. [2025-02-05 21:34:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:08,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:08,975 INFO L225 Difference]: With dead ends: 2940 [2025-02-05 21:34:08,975 INFO L226 Difference]: Without dead ends: 1961 [2025-02-05 21:34:08,981 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 21:34:08,982 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 214 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:08,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 721 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-02-05 21:34:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1959. [2025-02-05 21:34:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1446 states have (on average 1.5587828492392808) internal successors, (2254), 1450 states have internal predecessors, (2254), 494 states have call successors, (494), 18 states have call predecessors, (494), 18 states have return successors, (494), 490 states have call predecessors, (494), 494 states have call successors, (494) [2025-02-05 21:34:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3242 transitions. [2025-02-05 21:34:09,123 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3242 transitions. Word has length 471 [2025-02-05 21:34:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3242 transitions. [2025-02-05 21:34:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3242 transitions. [2025-02-05 21:34:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:09,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:09,127 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:34:09,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 256021753, now seen corresponding path program 1 times [2025-02-05 21:34:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67936650] [2025-02-05 21:34:09,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:09,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:09,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:09,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:09,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67936650] [2025-02-05 21:34:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67936650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:34:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203672088] [2025-02-05 21:34:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:34:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:34:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:34:09,495 INFO L87 Difference]: Start difference. First operand 1959 states and 3242 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:10,722 INFO L93 Difference]: Finished difference Result 7551 states and 12413 transitions. [2025-02-05 21:34:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:34:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:10,748 INFO L225 Difference]: With dead ends: 7551 [2025-02-05 21:34:10,749 INFO L226 Difference]: Without dead ends: 5595 [2025-02-05 21:34:10,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:34:10,755 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 941 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:10,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1958 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:34:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2025-02-05 21:34:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5199. [2025-02-05 21:34:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 3986 states have (on average 1.5689914701455092) internal successors, (6254), 4006 states have internal predecessors, (6254), 1150 states have call successors, (1150), 62 states have call predecessors, (1150), 62 states have return successors, (1150), 1130 states have call predecessors, (1150), 1150 states have call successors, (1150) [2025-02-05 21:34:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 8554 transitions. [2025-02-05 21:34:11,025 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 8554 transitions. Word has length 471 [2025-02-05 21:34:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:11,026 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 8554 transitions. [2025-02-05 21:34:11,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 8554 transitions. [2025-02-05 21:34:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:11,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:11,031 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:11,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:34:11,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash -937562665, now seen corresponding path program 1 times [2025-02-05 21:34:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348827324] [2025-02-05 21:34:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:11,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:11,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:11,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:11,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348827324] [2025-02-05 21:34:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348827324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:34:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079523614] [2025-02-05 21:34:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:34:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:34:11,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:34:11,308 INFO L87 Difference]: Start difference. First operand 5199 states and 8554 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:12,813 INFO L93 Difference]: Finished difference Result 13574 states and 22261 transitions. [2025-02-05 21:34:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:34:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-02-05 21:34:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:12,856 INFO L225 Difference]: With dead ends: 13574 [2025-02-05 21:34:12,856 INFO L226 Difference]: Without dead ends: 8378 [2025-02-05 21:34:12,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:34:12,871 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1267 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:12,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1430 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:34:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2025-02-05 21:34:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8297. [2025-02-05 21:34:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 6224 states have (on average 1.544987146529563) internal successors, (9616), 6259 states have internal predecessors, (9616), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-02-05 21:34:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 13540 transitions. [2025-02-05 21:34:13,462 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 13540 transitions. Word has length 471 [2025-02-05 21:34:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:13,463 INFO L471 AbstractCegarLoop]: Abstraction has 8297 states and 13540 transitions. [2025-02-05 21:34:13,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-02-05 21:34:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 13540 transitions. [2025-02-05 21:34:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:13,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:13,469 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:34:13,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1782034536, now seen corresponding path program 1 times [2025-02-05 21:34:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375254166] [2025-02-05 21:34:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:13,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:13,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:13,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:13,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375254166] [2025-02-05 21:34:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375254166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:13,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928152459] [2025-02-05 21:34:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:13,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:13,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:13,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:13,790 INFO L87 Difference]: Start difference. First operand 8297 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:14,162 INFO L93 Difference]: Finished difference Result 16573 states and 27081 transitions. [2025-02-05 21:34:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:14,218 INFO L225 Difference]: With dead ends: 16573 [2025-02-05 21:34:14,218 INFO L226 Difference]: Without dead ends: 8369 [2025-02-05 21:34:14,236 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 21:34:14,236 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:14,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2025-02-05 21:34:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 8369. [2025-02-05 21:34:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8369 states, 6296 states have (on average 1.5387547649301143) internal successors, (9688), 6331 states have internal predecessors, (9688), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-02-05 21:34:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 13612 transitions. [2025-02-05 21:34:14,631 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 13612 transitions. Word has length 471 [2025-02-05 21:34:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:14,632 INFO L471 AbstractCegarLoop]: Abstraction has 8369 states and 13612 transitions. [2025-02-05 21:34:14,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 13612 transitions. [2025-02-05 21:34:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:14,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:14,636 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:14,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:34:14,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 435723417, now seen corresponding path program 1 times [2025-02-05 21:34:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746319925] [2025-02-05 21:34:14,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:14,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746319925] [2025-02-05 21:34:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746319925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802332308] [2025-02-05 21:34:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:15,052 INFO L87 Difference]: Start difference. First operand 8369 states and 13612 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:16,096 INFO L93 Difference]: Finished difference Result 26651 states and 43345 transitions. [2025-02-05 21:34:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:34:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:16,149 INFO L225 Difference]: With dead ends: 26651 [2025-02-05 21:34:16,150 INFO L226 Difference]: Without dead ends: 18375 [2025-02-05 21:34:16,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:34:16,180 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 605 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:16,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1309 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:34:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18375 states. [2025-02-05 21:34:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18375 to 16579. [2025-02-05 21:34:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16579 states, 12484 states have (on average 1.525472604934316) internal successors, (19044), 12553 states have internal predecessors, (19044), 3872 states have call successors, (3872), 222 states have call predecessors, (3872), 222 states have return successors, (3872), 3803 states have call predecessors, (3872), 3872 states have call successors, (3872) [2025-02-05 21:34:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16579 states to 16579 states and 26788 transitions. [2025-02-05 21:34:16,964 INFO L78 Accepts]: Start accepts. Automaton has 16579 states and 26788 transitions. Word has length 471 [2025-02-05 21:34:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:16,965 INFO L471 AbstractCegarLoop]: Abstraction has 16579 states and 26788 transitions. [2025-02-05 21:34:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 16579 states and 26788 transitions. [2025-02-05 21:34:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:16,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:16,971 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:16,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:34:16,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:16,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 647074330, now seen corresponding path program 1 times [2025-02-05 21:34:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662495886] [2025-02-05 21:34:16,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:16,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:17,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:17,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:17,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:34:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662495886] [2025-02-05 21:34:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662495886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:34:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254767058] [2025-02-05 21:34:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:18,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:34:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:18,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:34:18,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:34:18,290 INFO L87 Difference]: Start difference. First operand 16579 states and 26788 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:34,302 INFO L93 Difference]: Finished difference Result 93211 states and 148981 transitions. [2025-02-05 21:34:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 21:34:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-02-05 21:34:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:34,610 INFO L225 Difference]: With dead ends: 93211 [2025-02-05 21:34:34,610 INFO L226 Difference]: Without dead ends: 76245 [2025-02-05 21:34:34,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2025-02-05 21:34:34,673 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 5527 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 3720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5527 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 7468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3720 IncrementalHoareTripleChecker+Valid, 3748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:34,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5527 Valid, 3672 Invalid, 7468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3720 Valid, 3748 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-02-05 21:34:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76245 states. [2025-02-05 21:34:37,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76245 to 37801. [2025-02-05 21:34:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37801 states, 28280 states have (on average 1.520862800565771) internal successors, (43010), 28449 states have internal predecessors, (43010), 9004 states have call successors, (9004), 516 states have call predecessors, (9004), 516 states have return successors, (9004), 8835 states have call predecessors, (9004), 9004 states have call successors, (9004) [2025-02-05 21:34:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37801 states to 37801 states and 61018 transitions. [2025-02-05 21:34:38,032 INFO L78 Accepts]: Start accepts. Automaton has 37801 states and 61018 transitions. Word has length 471 [2025-02-05 21:34:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 37801 states and 61018 transitions. [2025-02-05 21:34:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-02-05 21:34:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37801 states and 61018 transitions. [2025-02-05 21:34:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 21:34:38,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:38,047 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:34:38,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:38,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -648222660, now seen corresponding path program 1 times [2025-02-05 21:34:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346666689] [2025-02-05 21:34:38,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:38,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:38,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 69 proven. 156 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-02-05 21:34:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346666689] [2025-02-05 21:34:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346666689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:34:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954759584] [2025-02-05 21:34:38,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:38,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:34:38,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:38,520 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 21:34:38,523 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 21:34:38,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 21:34:38,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 21:34:38,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:38,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:34:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:34:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6693 proven. 102 refuted. 0 times theorem prover too weak. 4605 trivial. 0 not checked. [2025-02-05 21:34:39,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:34:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-02-05 21:34:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954759584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:34:40,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:34:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-02-05 21:34:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164049834] [2025-02-05 21:34:40,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:34:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 21:34:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:40,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 21:34:40,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:34:40,020 INFO L87 Difference]: Start difference. First operand 37801 states and 61018 transitions. Second operand has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-02-05 21:34:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:59,602 INFO L93 Difference]: Finished difference Result 184890 states and 289337 transitions. [2025-02-05 21:34:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-02-05 21:34:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) Word has length 471 [2025-02-05 21:34:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:00,088 INFO L225 Difference]: With dead ends: 184890 [2025-02-05 21:35:00,089 INFO L226 Difference]: Without dead ends: 146902 [2025-02-05 21:35:00,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9024 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4021, Invalid=18629, Unknown=0, NotChecked=0, Total=22650 [2025-02-05 21:35:00,393 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 5950 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 4003 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5950 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 7731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:00,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5950 Valid, 2601 Invalid, 7731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4003 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 21:35:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146902 states. [2025-02-05 21:35:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146902 to 80145. [2025-02-05 21:35:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80145 states, 63881 states have (on average 1.5377968410012366) internal successors, (98236), 64148 states have internal predecessors, (98236), 14894 states have call successors, (14894), 1369 states have call predecessors, (14894), 1369 states have return successors, (14894), 14627 states have call predecessors, (14894), 14894 states have call successors, (14894) [2025-02-05 21:35:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80145 states to 80145 states and 128024 transitions. [2025-02-05 21:35:07,827 INFO L78 Accepts]: Start accepts. Automaton has 80145 states and 128024 transitions. Word has length 471 [2025-02-05 21:35:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:07,828 INFO L471 AbstractCegarLoop]: Abstraction has 80145 states and 128024 transitions. [2025-02-05 21:35:07,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-02-05 21:35:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 80145 states and 128024 transitions. [2025-02-05 21:35:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-05 21:35:07,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:07,844 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:07,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:35:08,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:08,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:08,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash -159724448, now seen corresponding path program 1 times [2025-02-05 21:35:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676266329] [2025-02-05 21:35:08,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:08,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-05 21:35:08,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-05 21:35:08,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:08,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-02-05 21:35:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676266329] [2025-02-05 21:35:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676266329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996821776] [2025-02-05 21:35:08,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:08,465 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 21:35:08,467 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 21:35:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-05 21:35:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-05 21:35:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:08,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:35:08,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6021 proven. 192 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2025-02-05 21:35:09,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 252 proven. 195 refuted. 0 times theorem prover too weak. 10953 trivial. 0 not checked. [2025-02-05 21:35:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996821776] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:09,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-02-05 21:35:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425918084] [2025-02-05 21:35:09,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 21:35:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:09,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 21:35:09,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:35:09,764 INFO L87 Difference]: Start difference. First operand 80145 states and 128024 transitions. Second operand has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-02-05 21:35:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:16,123 INFO L93 Difference]: Finished difference Result 136643 states and 216819 transitions. [2025-02-05 21:35:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 21:35:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) Word has length 472 [2025-02-05 21:35:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:16,375 INFO L225 Difference]: With dead ends: 136643 [2025-02-05 21:35:16,376 INFO L226 Difference]: Without dead ends: 66323 [2025-02-05 21:35:16,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 21:35:16,490 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 3521 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 4025 mSolverCounterSat, 1608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3564 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 4025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:16,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3564 Valid, 4020 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 4025 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 21:35:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66323 states. [2025-02-05 21:35:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66323 to 52111. [2025-02-05 21:35:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52111 states, 42354 states have (on average 1.5501251357604948) internal successors, (65654), 42479 states have internal predecessors, (65654), 8909 states have call successors, (8909), 847 states have call predecessors, (8909), 847 states have return successors, (8909), 8784 states have call predecessors, (8909), 8909 states have call successors, (8909) [2025-02-05 21:35:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52111 states to 52111 states and 83472 transitions. [2025-02-05 21:35:19,892 INFO L78 Accepts]: Start accepts. Automaton has 52111 states and 83472 transitions. Word has length 472 [2025-02-05 21:35:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:19,893 INFO L471 AbstractCegarLoop]: Abstraction has 52111 states and 83472 transitions. [2025-02-05 21:35:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-02-05 21:35:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 52111 states and 83472 transitions. [2025-02-05 21:35:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-05 21:35:19,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:19,902 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:19,909 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 21:35:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:20,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:20,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 785907903, now seen corresponding path program 1 times [2025-02-05 21:35:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:20,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37903626] [2025-02-05 21:35:20,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:20,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-05 21:35:20,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-05 21:35:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-02-05 21:35:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37903626] [2025-02-05 21:35:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37903626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:20,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:35:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71961010] [2025-02-05 21:35:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:35:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:35:20,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:35:20,389 INFO L87 Difference]: Start difference. First operand 52111 states and 83472 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76)