./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.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 e26bc3348a806ff5be59d4e299270ec94a7d4962bb4f1a8d7ce9c935e106e68d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:58:44,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:58:44,142 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:58:44,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:58:44,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:58:44,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:58:44,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:58:44,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:58:44,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:58:44,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:58:44,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:58:44,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:58:44,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:58:44,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:58:44,170 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:58:44,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:58:44,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:58:44,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:58:44,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:58:44,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:44,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:58:44,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:58:44,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:58:44,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:58:44,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:58:44,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:58:44,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:58:44,174 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 -> e26bc3348a806ff5be59d4e299270ec94a7d4962bb4f1a8d7ce9c935e106e68d [2025-02-05 21:58:44,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:58:44,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:58:44,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:58:44,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:58:44,402 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:58:44,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i [2025-02-05 21:58:45,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10eb8e291/b7d96e6cf35d40509f7a32c5d13b1296/FLAGe117ab945 [2025-02-05 21:58:45,877 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:58:45,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i [2025-02-05 21:58:45,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10eb8e291/b7d96e6cf35d40509f7a32c5d13b1296/FLAGe117ab945 [2025-02-05 21:58:45,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10eb8e291/b7d96e6cf35d40509f7a32c5d13b1296 [2025-02-05 21:58:45,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:58:45,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:58:45,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:45,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:58:45,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:58:45,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:45" (1/1) ... [2025-02-05 21:58:45,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c881f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:45, skipping insertion in model container [2025-02-05 21:58:45,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:45" (1/1) ... [2025-02-05 21:58:45,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:58:46,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i[916,929] [2025-02-05 21:58:46,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:46,237 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:58:46,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i[916,929] [2025-02-05 21:58:46,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:46,348 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:58:46,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46 WrapperNode [2025-02-05 21:58:46,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:46,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:46,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:58:46,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:58:46,355 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:58:46" (1/1) ... [2025-02-05 21:58:46,370 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:58:46" (1/1) ... [2025-02-05 21:58:46,443 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 876 [2025-02-05 21:58:46,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:46,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:58:46,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:58:46,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:58:46,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,517 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:58:46,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:58:46,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:58:46,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:58:46,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:58:46,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (1/1) ... [2025-02-05 21:58:46,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:46,643 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:58:46,645 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:58:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:58:46,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:58:46,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:58:46,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:58:46,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:58:46,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:58:46,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:58:46,783 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:58:47,906 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 21:58:47,907 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:58:47,947 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:58:47,950 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:58:47,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:47 BoogieIcfgContainer [2025-02-05 21:58:47,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:58:47,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:58:47,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:58:47,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:58:47,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:58:45" (1/3) ... [2025-02-05 21:58:47,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:47, skipping insertion in model container [2025-02-05 21:58:47,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:46" (2/3) ... [2025-02-05 21:58:47,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:47, skipping insertion in model container [2025-02-05 21:58:47,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:47" (3/3) ... [2025-02-05 21:58:47,960 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-50.i [2025-02-05 21:58:47,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:58:47,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-50.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:58:48,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:58:48,047 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;@6f3f076b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:58:48,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:58:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 261 states have (on average 1.6130268199233717) internal successors, (421), 262 states have internal predecessors, (421), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 21:58:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:58:48,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:48,089 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:48,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1444653108, now seen corresponding path program 1 times [2025-02-05 21:58:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:48,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445933210] [2025-02-05 21:58:48,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:48,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:58:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:58:48,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:48,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-02-05 21:58:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445933210] [2025-02-05 21:58:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445933210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:48,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325273786] [2025-02-05 21:58:48,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:48,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:48,673 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:58:48,675 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:58:48,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:58:49,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:58:49,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:49,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1464 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:58:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-02-05 21:58:49,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:58:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325273786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:58:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:58:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106222085] [2025-02-05 21:58:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:49,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:58:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:49,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:58:49,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:58:49,123 INFO L87 Difference]: Start difference. First operand has 362 states, 261 states have (on average 1.6130268199233717) internal successors, (421), 262 states have internal predecessors, (421), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-02-05 21:58:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:49,227 INFO L93 Difference]: Finished difference Result 713 states and 1319 transitions. [2025-02-05 21:58:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:58:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 638 [2025-02-05 21:58:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:49,240 INFO L225 Difference]: With dead ends: 713 [2025-02-05 21:58:49,240 INFO L226 Difference]: Without dead ends: 354 [2025-02-05 21:58:49,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 639 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:58:49,250 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:49,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-05 21:58:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-02-05 21:58:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 254 states have (on average 1.5826771653543308) internal successors, (402), 254 states have internal predecessors, (402), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 21:58:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 598 transitions. [2025-02-05 21:58:49,332 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 598 transitions. Word has length 638 [2025-02-05 21:58:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:49,335 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 598 transitions. [2025-02-05 21:58:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-02-05 21:58:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 598 transitions. [2025-02-05 21:58:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:58:49,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:49,347 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,356 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:58:49,552 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:58:49,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:49,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -859151084, now seen corresponding path program 1 times [2025-02-05 21:58:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060287577] [2025-02-05 21:58:49,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:58:49,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:58:49,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:49,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060287577] [2025-02-05 21:58:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060287577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775001289] [2025-02-05 21:58:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:50,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:50,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:50,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:50,192 INFO L87 Difference]: Start difference. First operand 354 states and 598 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:50,308 INFO L93 Difference]: Finished difference Result 855 states and 1446 transitions. [2025-02-05 21:58:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-02-05 21:58:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:50,317 INFO L225 Difference]: With dead ends: 855 [2025-02-05 21:58:50,317 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 21:58:50,319 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:58:50,320 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 212 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:50,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1234 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 21:58:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2025-02-05 21:58:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 366 states have (on average 1.5956284153005464) internal successors, (584), 367 states have internal predecessors, (584), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:58:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 848 transitions. [2025-02-05 21:58:50,369 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 848 transitions. Word has length 639 [2025-02-05 21:58:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:50,370 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 848 transitions. [2025-02-05 21:58:50,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 848 transitions. [2025-02-05 21:58:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:58:50,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:50,379 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:50,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:58:50,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1369685261, now seen corresponding path program 1 times [2025-02-05 21:58:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644253520] [2025-02-05 21:58:50,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:50,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:58:50,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:58:50,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:50,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:51,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644253520] [2025-02-05 21:58:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644253520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:51,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517580714] [2025-02-05 21:58:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:51,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:51,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:51,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:51,034 INFO L87 Difference]: Start difference. First operand 501 states and 848 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:51,429 INFO L93 Difference]: Finished difference Result 1498 states and 2540 transitions. [2025-02-05 21:58:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-02-05 21:58:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:51,443 INFO L225 Difference]: With dead ends: 1498 [2025-02-05 21:58:51,443 INFO L226 Difference]: Without dead ends: 1000 [2025-02-05 21:58:51,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:58:51,447 INFO L435 NwaCegarLoop]: 1062 mSDtfsCounter, 575 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:51,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1986 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:58:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-02-05 21:58:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2025-02-05 21:58:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 729 states have (on average 1.5967078189300412) internal successors, (1164), 731 states have internal predecessors, (1164), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 262 states have call predecessors, (264), 264 states have call successors, (264) [2025-02-05 21:58:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1692 transitions. [2025-02-05 21:58:51,550 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1692 transitions. Word has length 639 [2025-02-05 21:58:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:51,552 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1692 transitions. [2025-02-05 21:58:51,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1692 transitions. [2025-02-05 21:58:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:58:51,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:51,564 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:58:51,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash -931675758, now seen corresponding path program 1 times [2025-02-05 21:58:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174614335] [2025-02-05 21:58:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:51,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:58:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:58:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174614335] [2025-02-05 21:58:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174614335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468840913] [2025-02-05 21:58:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:51,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:51,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:51,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:51,916 INFO L87 Difference]: Start difference. First operand 998 states and 1692 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:56,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:58:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:56,140 INFO L93 Difference]: Finished difference Result 2974 states and 5048 transitions. [2025-02-05 21:58:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:56,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-02-05 21:58:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:56,151 INFO L225 Difference]: With dead ends: 2974 [2025-02-05 21:58:56,152 INFO L226 Difference]: Without dead ends: 1979 [2025-02-05 21:58:56,155 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:58:56,157 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 545 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:56,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1529 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 21:58:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-02-05 21:58:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1977. [2025-02-05 21:58:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1440 states have (on average 1.5888888888888888) internal successors, (2288), 1444 states have internal predecessors, (2288), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 524 states have call predecessors, (528), 528 states have call successors, (528) [2025-02-05 21:58:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3344 transitions. [2025-02-05 21:58:56,289 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 3344 transitions. Word has length 639 [2025-02-05 21:58:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:56,289 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 3344 transitions. [2025-02-05 21:58:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3344 transitions. [2025-02-05 21:58:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:58:56,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:56,295 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:56,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:58:56,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 898434986, now seen corresponding path program 1 times [2025-02-05 21:58:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:56,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921679820] [2025-02-05 21:58:56,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:56,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:58:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:58:56,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:56,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921679820] [2025-02-05 21:58:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921679820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:56,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076123590] [2025-02-05 21:58:56,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:56,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:56,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:56,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:56,698 INFO L87 Difference]: Start difference. First operand 1977 states and 3344 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:57,195 INFO L93 Difference]: Finished difference Result 5917 states and 10010 transitions. [2025-02-05 21:58:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 641 [2025-02-05 21:58:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:57,219 INFO L225 Difference]: With dead ends: 5917 [2025-02-05 21:58:57,219 INFO L226 Difference]: Without dead ends: 3943 [2025-02-05 21:58:57,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:57,224 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 591 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:57,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1513 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:58:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-02-05 21:58:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 2009. [2025-02-05 21:58:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1472 states have (on average 1.5815217391304348) internal successors, (2328), 1476 states have internal predecessors, (2328), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 524 states have call predecessors, (528), 528 states have call successors, (528) [2025-02-05 21:58:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 3384 transitions. [2025-02-05 21:58:57,450 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 3384 transitions. Word has length 641 [2025-02-05 21:58:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:57,451 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 3384 transitions. [2025-02-05 21:58:57,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3384 transitions. [2025-02-05 21:58:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:58:57,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:57,455 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:58:57,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1785938667, now seen corresponding path program 1 times [2025-02-05 21:58:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138947366] [2025-02-05 21:58:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:58:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:58:57,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:57,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138947366] [2025-02-05 21:58:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138947366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075401685] [2025-02-05 21:58:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:57,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:57,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:57,958 INFO L87 Difference]: Start difference. First operand 2009 states and 3384 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:58,263 INFO L93 Difference]: Finished difference Result 6021 states and 10146 transitions. [2025-02-05 21:58:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:58,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 641 [2025-02-05 21:58:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:58,288 INFO L225 Difference]: With dead ends: 6021 [2025-02-05 21:58:58,289 INFO L226 Difference]: Without dead ends: 4015 [2025-02-05 21:58:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:58,298 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 431 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:58,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1416 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2025-02-05 21:58:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4013. [2025-02-05 21:58:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 2940 states have (on average 1.5755102040816327) internal successors, (4632), 2948 states have internal predecessors, (4632), 1056 states have call successors, (1056), 16 states have call predecessors, (1056), 16 states have return successors, (1056), 1048 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-02-05 21:58:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 6744 transitions. [2025-02-05 21:58:58,618 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 6744 transitions. Word has length 641 [2025-02-05 21:58:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:58,619 INFO L471 AbstractCegarLoop]: Abstraction has 4013 states and 6744 transitions. [2025-02-05 21:58:58,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 6744 transitions. [2025-02-05 21:58:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:58:58,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:58,626 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:58,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:58:58,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1655915464, now seen corresponding path program 1 times [2025-02-05 21:58:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266203679] [2025-02-05 21:58:58,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:58:58,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:58:58,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:58:58,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266203679] [2025-02-05 21:58:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266203679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:58,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:58,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:58,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835221077] [2025-02-05 21:58:58,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:58,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:58,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:58,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:58,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:58,968 INFO L87 Difference]: Start difference. First operand 4013 states and 6744 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:59,305 INFO L93 Difference]: Finished difference Result 12033 states and 20226 transitions. [2025-02-05 21:58:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-02-05 21:58:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:59,343 INFO L225 Difference]: With dead ends: 12033 [2025-02-05 21:58:59,344 INFO L226 Difference]: Without dead ends: 8023 [2025-02-05 21:58:59,358 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:58:59,359 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 591 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:59,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8023 states. [2025-02-05 21:58:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8023 to 4045. [2025-02-05 21:58:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2972 states have (on average 1.5720053835800807) internal successors, (4672), 2980 states have internal predecessors, (4672), 1056 states have call successors, (1056), 16 states have call predecessors, (1056), 16 states have return successors, (1056), 1048 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-02-05 21:58:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 6784 transitions. [2025-02-05 21:58:59,845 INFO L78 Accepts]: Start accepts. Automaton has 4045 states and 6784 transitions. Word has length 642 [2025-02-05 21:58:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:59,846 INFO L471 AbstractCegarLoop]: Abstraction has 4045 states and 6784 transitions. [2025-02-05 21:58:59,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:58:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4045 states and 6784 transitions. [2025-02-05 21:58:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:58:59,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:59,856 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:58:59,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1686935271, now seen corresponding path program 1 times [2025-02-05 21:58:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873761962] [2025-02-05 21:58:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:59,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:58:59,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:58:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:59,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873761962] [2025-02-05 21:59:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873761962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:00,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:00,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794824649] [2025-02-05 21:59:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:00,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:00,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:00,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:00,449 INFO L87 Difference]: Start difference. First operand 4045 states and 6784 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:01,310 INFO L93 Difference]: Finished difference Result 14099 states and 23663 transitions. [2025-02-05 21:59:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-02-05 21:59:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:01,374 INFO L225 Difference]: With dead ends: 14099 [2025-02-05 21:59:01,375 INFO L226 Difference]: Without dead ends: 10057 [2025-02-05 21:59:01,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:59:01,389 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1043 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:01,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 2046 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:59:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2025-02-05 21:59:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 7493. [2025-02-05 21:59:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7493 states, 5956 states have (on average 1.610476830087307) internal successors, (9592), 5980 states have internal predecessors, (9592), 1504 states have call successors, (1504), 32 states have call predecessors, (1504), 32 states have return successors, (1504), 1480 states have call predecessors, (1504), 1504 states have call successors, (1504) [2025-02-05 21:59:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7493 states to 7493 states and 12600 transitions. [2025-02-05 21:59:01,821 INFO L78 Accepts]: Start accepts. Automaton has 7493 states and 12600 transitions. Word has length 642 [2025-02-05 21:59:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:01,822 INFO L471 AbstractCegarLoop]: Abstraction has 7493 states and 12600 transitions. [2025-02-05 21:59:01,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7493 states and 12600 transitions. [2025-02-05 21:59:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:59:01,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:01,831 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:01,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -120912250, now seen corresponding path program 1 times [2025-02-05 21:59:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857508336] [2025-02-05 21:59:01,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:59:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:59:01,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:01,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857508336] [2025-02-05 21:59:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857508336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:02,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:02,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766327346] [2025-02-05 21:59:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:02,265 INFO L87 Difference]: Start difference. First operand 7493 states and 12600 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:02,801 INFO L93 Difference]: Finished difference Result 20809 states and 34974 transitions. [2025-02-05 21:59:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-02-05 21:59:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:02,851 INFO L225 Difference]: With dead ends: 20809 [2025-02-05 21:59:02,851 INFO L226 Difference]: Without dead ends: 13319 [2025-02-05 21:59:02,878 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:59:02,879 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 330 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:02,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1100 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2025-02-05 21:59:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 13285. [2025-02-05 21:59:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13285 states, 10884 states have (on average 1.6185226019845644) internal successors, (17616), 10940 states have internal predecessors, (17616), 2336 states have call successors, (2336), 64 states have call predecessors, (2336), 64 states have return successors, (2336), 2280 states have call predecessors, (2336), 2336 states have call successors, (2336) [2025-02-05 21:59:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 22288 transitions. [2025-02-05 21:59:03,463 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 22288 transitions. Word has length 642 [2025-02-05 21:59:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:03,464 INFO L471 AbstractCegarLoop]: Abstraction has 13285 states and 22288 transitions. [2025-02-05 21:59:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 22288 transitions. [2025-02-05 21:59:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:03,480 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:03,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1556870460, now seen corresponding path program 1 times [2025-02-05 21:59:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130125362] [2025-02-05 21:59:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:03,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130125362] [2025-02-05 21:59:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130125362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:59:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963890831] [2025-02-05 21:59:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:03,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:59:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:03,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:59:03,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:59:03,835 INFO L87 Difference]: Start difference. First operand 13285 states and 22288 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:07,501 INFO L93 Difference]: Finished difference Result 80451 states and 134327 transitions. [2025-02-05 21:59:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:59:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-02-05 21:59:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:07,730 INFO L225 Difference]: With dead ends: 80451 [2025-02-05 21:59:07,731 INFO L226 Difference]: Without dead ends: 67169 [2025-02-05 21:59:07,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:59:07,769 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 2354 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:07,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 4568 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:59:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67169 states. [2025-02-05 21:59:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67169 to 33173. [2025-02-05 21:59:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33173 states, 27224 states have (on average 1.622318542462533) internal successors, (44166), 27372 states have internal predecessors, (44166), 5756 states have call successors, (5756), 192 states have call predecessors, (5756), 192 states have return successors, (5756), 5608 states have call predecessors, (5756), 5756 states have call successors, (5756) [2025-02-05 21:59:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33173 states to 33173 states and 55678 transitions. [2025-02-05 21:59:09,747 INFO L78 Accepts]: Start accepts. Automaton has 33173 states and 55678 transitions. Word has length 643 [2025-02-05 21:59:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 33173 states and 55678 transitions. [2025-02-05 21:59:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 33173 states and 55678 transitions. [2025-02-05 21:59:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:09,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:09,779 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:09,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:09,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 948793597, now seen corresponding path program 1 times [2025-02-05 21:59:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130004116] [2025-02-05 21:59:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:09,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:09,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:09,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:09,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130004116] [2025-02-05 21:59:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130004116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:10,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:10,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598701851] [2025-02-05 21:59:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:10,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:10,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:10,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:10,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:10,002 INFO L87 Difference]: Start difference. First operand 33173 states and 55678 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:11,209 INFO L93 Difference]: Finished difference Result 66415 states and 111497 transitions. [2025-02-05 21:59:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-02-05 21:59:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:11,328 INFO L225 Difference]: With dead ends: 66415 [2025-02-05 21:59:11,328 INFO L226 Difference]: Without dead ends: 33245 [2025-02-05 21:59:11,397 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:59:11,398 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:11,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1149 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33245 states. [2025-02-05 21:59:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33245 to 33197. [2025-02-05 21:59:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33197 states, 27248 states have (on average 1.6217704051673518) internal successors, (44190), 27396 states have internal predecessors, (44190), 5756 states have call successors, (5756), 192 states have call predecessors, (5756), 192 states have return successors, (5756), 5608 states have call predecessors, (5756), 5756 states have call successors, (5756) [2025-02-05 21:59:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33197 states to 33197 states and 55702 transitions. [2025-02-05 21:59:13,103 INFO L78 Accepts]: Start accepts. Automaton has 33197 states and 55702 transitions. Word has length 643 [2025-02-05 21:59:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:13,104 INFO L471 AbstractCegarLoop]: Abstraction has 33197 states and 55702 transitions. [2025-02-05 21:59:13,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33197 states and 55702 transitions. [2025-02-05 21:59:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:13,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:13,137 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:13,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:59:13,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:13,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1393106114, now seen corresponding path program 1 times [2025-02-05 21:59:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746472723] [2025-02-05 21:59:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:13,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746472723] [2025-02-05 21:59:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746472723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:59:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707796839] [2025-02-05 21:59:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:13,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:59:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:13,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:59:13,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:59:13,854 INFO L87 Difference]: Start difference. First operand 33197 states and 55702 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:19,911 INFO L93 Difference]: Finished difference Result 144711 states and 242910 transitions. [2025-02-05 21:59:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:59:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-02-05 21:59:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:20,224 INFO L225 Difference]: With dead ends: 144711 [2025-02-05 21:59:20,225 INFO L226 Difference]: Without dead ends: 111517 [2025-02-05 21:59:20,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:59:20,314 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1767 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:20,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 2204 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:59:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111517 states. [2025-02-05 21:59:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111517 to 77673. [2025-02-05 21:59:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77673 states, 65804 states have (on average 1.630964682997994) internal successors, (107324), 66192 states have internal predecessors, (107324), 11356 states have call successors, (11356), 512 states have call predecessors, (11356), 512 states have return successors, (11356), 10968 states have call predecessors, (11356), 11356 states have call successors, (11356) [2025-02-05 21:59:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77673 states to 77673 states and 130036 transitions. [2025-02-05 21:59:23,727 INFO L78 Accepts]: Start accepts. Automaton has 77673 states and 130036 transitions. Word has length 643 [2025-02-05 21:59:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:23,728 INFO L471 AbstractCegarLoop]: Abstraction has 77673 states and 130036 transitions. [2025-02-05 21:59:23,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-05 21:59:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 77673 states and 130036 transitions. [2025-02-05 21:59:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-02-05 21:59:23,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:23,785 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:23,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:59:23,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2060655275, now seen corresponding path program 1 times [2025-02-05 21:59:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393516736] [2025-02-05 21:59:23,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-02-05 21:59:23,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-02-05 21:59:23,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:23,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-02-05 21:59:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393516736] [2025-02-05 21:59:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393516736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:59:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021543195] [2025-02-05 21:59:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:59:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:24,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:59:24,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:59:24,190 INFO L87 Difference]: Start difference. First operand 77673 states and 130036 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98)