./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:11:05,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:11:05,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:11:05,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:11:05,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:11:05,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:11:05,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:11:05,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:11:05,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:11:05,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:11:05,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:11:05,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:11:05,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:11:05,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:11:05,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:11:05,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:11:05,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:11:05,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:11:05,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:11:05,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:11:05,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:11:05,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:11:05,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:11:05,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:11:05,134 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/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 -> 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 [2025-03-17 00:11:05,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:11:05,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:11:05,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:11:05,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:11:05,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:11:05,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-17 00:11:06,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2575141/2735380e1c104eff84d9dd201a546dbb/FLAGd3ec4bfd7 [2025-03-17 00:11:06,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:11:06,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-17 00:11:06,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2575141/2735380e1c104eff84d9dd201a546dbb/FLAGd3ec4bfd7 [2025-03-17 00:11:06,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2575141/2735380e1c104eff84d9dd201a546dbb [2025-03-17 00:11:06,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:11:06,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:11:06,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:11:06,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:11:06,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:11:06,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:06" (1/1) ... [2025-03-17 00:11:06,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be2e56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:06, skipping insertion in model container [2025-03-17 00:11:06,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:06" (1/1) ... [2025-03-17 00:11:06,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:11:07,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-17 00:11:07,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:11:07,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:11:07,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-17 00:11:07,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:11:07,259 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:11:07,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07 WrapperNode [2025-03-17 00:11:07,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:11:07,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:11:07,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:11:07,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:11:07,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,323 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 599 [2025-03-17 00:11:07,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:11:07,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:11:07,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:11:07,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:11:07,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,373 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-03-17 00:11:07,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:11:07,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:11:07,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:11:07,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:11:07,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (1/1) ... [2025-03-17 00:11:07,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:11:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:07,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:11:07,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:11:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:11:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:11:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:11:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:11:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:11:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:11:07,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:11:07,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:11:08,285 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:11:08,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:11:08,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:11:08,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:11:08,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:08 BoogieIcfgContainer [2025-03-17 00:11:08,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:11:08,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:11:08,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:11:08,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:11:08,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:11:06" (1/3) ... [2025-03-17 00:11:08,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73721a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:08, skipping insertion in model container [2025-03-17 00:11:08,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:07" (2/3) ... [2025-03-17 00:11:08,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73721a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:08, skipping insertion in model container [2025-03-17 00:11:08,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:08" (3/3) ... [2025-03-17 00:11:08,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-17 00:11:08,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:11:08,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i that has 2 procedures, 251 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:11:08,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:11:08,404 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;@859de6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:11:08,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:11:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 155 states have internal predecessors, (234), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 00:11:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-17 00:11:08,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:08,428 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:08,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1297645632, now seen corresponding path program 1 times [2025-03-17 00:11:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839471211] [2025-03-17 00:11:08,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-17 00:11:08,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 00:11:08,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:08,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-17 00:11:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839471211] [2025-03-17 00:11:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839471211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735934182] [2025-03-17 00:11:08,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:08,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:08,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:08,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:11:08,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:11:09,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-17 00:11:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 00:11:09,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:09,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:11:09,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-17 00:11:09,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:11:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735934182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:11:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:11:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488085690] [2025-03-17 00:11:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:11:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:09,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:11:09,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:11:09,335 INFO L87 Difference]: Start difference. First operand has 251 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 155 states have internal predecessors, (234), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-17 00:11:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:09,398 INFO L93 Difference]: Finished difference Result 499 states and 936 transitions. [2025-03-17 00:11:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:11:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 573 [2025-03-17 00:11:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:09,406 INFO L225 Difference]: With dead ends: 499 [2025-03-17 00:11:09,406 INFO L226 Difference]: Without dead ends: 249 [2025-03-17 00:11:09,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 574 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-03-17 00:11:09,414 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:09,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-17 00:11:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-03-17 00:11:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 153 states have internal predecessors, (228), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 00:11:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 416 transitions. [2025-03-17 00:11:09,494 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 416 transitions. Word has length 573 [2025-03-17 00:11:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:09,494 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 416 transitions. [2025-03-17 00:11:09,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-17 00:11:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 416 transitions. [2025-03-17 00:11:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-17 00:11:09,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:09,510 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:09,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:11:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:11:09,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:09,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1256758156, now seen corresponding path program 1 times [2025-03-17 00:11:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182347985] [2025-03-17 00:11:09,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-17 00:11:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-17 00:11:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182347985] [2025-03-17 00:11:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182347985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:10,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240097463] [2025-03-17 00:11:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:10,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:10,290 INFO L87 Difference]: Start difference. First operand 249 states and 416 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:10,390 INFO L93 Difference]: Finished difference Result 659 states and 1106 transitions. [2025-03-17 00:11:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:10,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 574 [2025-03-17 00:11:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:10,398 INFO L225 Difference]: With dead ends: 659 [2025-03-17 00:11:10,399 INFO L226 Difference]: Without dead ends: 411 [2025-03-17 00:11:10,400 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-03-17 00:11:10,402 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 263 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:10,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 904 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:11:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-17 00:11:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2025-03-17 00:11:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 269 states have (on average 1.546468401486989) internal successors, (416), 270 states have internal predecessors, (416), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 00:11:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 688 transitions. [2025-03-17 00:11:10,452 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 688 transitions. Word has length 574 [2025-03-17 00:11:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:10,455 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 688 transitions. [2025-03-17 00:11:10,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 688 transitions. [2025-03-17 00:11:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:10,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:10,461 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:11:10,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:10,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -785876441, now seen corresponding path program 1 times [2025-03-17 00:11:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:10,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668186094] [2025-03-17 00:11:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668186094] [2025-03-17 00:11:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668186094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:10,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659742017] [2025-03-17 00:11:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:10,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:10,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:10,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:10,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:10,721 INFO L87 Difference]: Start difference. First operand 408 states and 688 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:10,809 INFO L93 Difference]: Finished difference Result 1099 states and 1853 transitions. [2025-03-17 00:11:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:10,822 INFO L225 Difference]: With dead ends: 1099 [2025-03-17 00:11:10,822 INFO L226 Difference]: Without dead ends: 692 [2025-03-17 00:11:10,824 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-03-17 00:11:10,825 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 249 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:10,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 907 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-17 00:11:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 689. [2025-03-17 00:11:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 457 states have (on average 1.5448577680525164) internal successors, (706), 460 states have internal predecessors, (706), 227 states have call successors, (227), 4 states have call predecessors, (227), 4 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-03-17 00:11:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1160 transitions. [2025-03-17 00:11:10,890 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1160 transitions. Word has length 575 [2025-03-17 00:11:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:10,891 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1160 transitions. [2025-03-17 00:11:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1160 transitions. [2025-03-17 00:11:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:10,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:10,909 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:10,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:11:10,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1431881512, now seen corresponding path program 1 times [2025-03-17 00:11:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598595010] [2025-03-17 00:11:10,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:10,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:10,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598595010] [2025-03-17 00:11:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598595010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617299907] [2025-03-17 00:11:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:11,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:11,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:11,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:11,145 INFO L87 Difference]: Start difference. First operand 689 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:11,269 INFO L93 Difference]: Finished difference Result 1957 states and 3296 transitions. [2025-03-17 00:11:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:11,281 INFO L225 Difference]: With dead ends: 1957 [2025-03-17 00:11:11,282 INFO L226 Difference]: Without dead ends: 1269 [2025-03-17 00:11:11,286 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-03-17 00:11:11,288 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 259 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:11,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1022 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:11:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-17 00:11:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1266. [2025-03-17 00:11:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 842 states have (on average 1.5451306413301662) internal successors, (1301), 849 states have internal predecessors, (1301), 415 states have call successors, (415), 8 states have call predecessors, (415), 8 states have return successors, (415), 408 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-17 00:11:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2131 transitions. [2025-03-17 00:11:11,393 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2131 transitions. Word has length 575 [2025-03-17 00:11:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 2131 transitions. [2025-03-17 00:11:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2131 transitions. [2025-03-17 00:11:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:11,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:11,398 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:11:11,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1137604887, now seen corresponding path program 1 times [2025-03-17 00:11:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601477694] [2025-03-17 00:11:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:11,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:11,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:11,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601477694] [2025-03-17 00:11:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601477694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024402620] [2025-03-17 00:11:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:11,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:11,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:11,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:11,593 INFO L87 Difference]: Start difference. First operand 1266 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:11,752 INFO L93 Difference]: Finished difference Result 3676 states and 6167 transitions. [2025-03-17 00:11:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:11,767 INFO L225 Difference]: With dead ends: 3676 [2025-03-17 00:11:11,768 INFO L226 Difference]: Without dead ends: 2411 [2025-03-17 00:11:11,773 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-03-17 00:11:11,773 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 391 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:11,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1125 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-03-17 00:11:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2409. [2025-03-17 00:11:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1562 states have (on average 1.5057618437900129) internal successors, (2352), 1576 states have internal predecessors, (2352), 830 states have call successors, (830), 16 states have call predecessors, (830), 16 states have return successors, (830), 816 states have call predecessors, (830), 830 states have call successors, (830) [2025-03-17 00:11:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 4012 transitions. [2025-03-17 00:11:11,949 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 4012 transitions. Word has length 575 [2025-03-17 00:11:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 4012 transitions. [2025-03-17 00:11:11,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 4012 transitions. [2025-03-17 00:11:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:11,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:11,957 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:11,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:11:11,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:11,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash -135611703, now seen corresponding path program 1 times [2025-03-17 00:11:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576768079] [2025-03-17 00:11:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:12,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:12,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:12,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576768079] [2025-03-17 00:11:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576768079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:11:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399914221] [2025-03-17 00:11:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:11:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:11:12,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:12,509 INFO L87 Difference]: Start difference. First operand 2409 states and 4012 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:13,097 INFO L93 Difference]: Finished difference Result 7103 states and 11833 transitions. [2025-03-17 00:11:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:13,128 INFO L225 Difference]: With dead ends: 7103 [2025-03-17 00:11:13,128 INFO L226 Difference]: Without dead ends: 4695 [2025-03-17 00:11:13,136 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-03-17 00:11:13,138 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 670 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:13,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1138 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:11:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2025-03-17 00:11:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 3689. [2025-03-17 00:11:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 2419 states have (on average 1.510541546093427) internal successors, (3654), 2440 states have internal predecessors, (3654), 1245 states have call successors, (1245), 24 states have call predecessors, (1245), 24 states have return successors, (1245), 1224 states have call predecessors, (1245), 1245 states have call successors, (1245) [2025-03-17 00:11:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 6144 transitions. [2025-03-17 00:11:13,457 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 6144 transitions. Word has length 575 [2025-03-17 00:11:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:13,458 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 6144 transitions. [2025-03-17 00:11:13,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 6144 transitions. [2025-03-17 00:11:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:13,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:13,463 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:11:13,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1855089092, now seen corresponding path program 1 times [2025-03-17 00:11:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698319248] [2025-03-17 00:11:13,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:13,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:13,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:13,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:13,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698319248] [2025-03-17 00:11:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698319248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:13,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:13,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584220419] [2025-03-17 00:11:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:13,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:13,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:13,853 INFO L87 Difference]: Start difference. First operand 3689 states and 6144 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:14,235 INFO L93 Difference]: Finished difference Result 9622 states and 15974 transitions. [2025-03-17 00:11:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:14,278 INFO L225 Difference]: With dead ends: 9622 [2025-03-17 00:11:14,279 INFO L226 Difference]: Without dead ends: 5934 [2025-03-17 00:11:14,294 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-03-17 00:11:14,295 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 408 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:14,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 784 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:11:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2025-03-17 00:11:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5924. [2025-03-17 00:11:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5924 states, 3767 states have (on average 1.4812848420493763) internal successors, (5580), 3801 states have internal predecessors, (5580), 2114 states have call successors, (2114), 42 states have call predecessors, (2114), 42 states have return successors, (2114), 2080 states have call predecessors, (2114), 2114 states have call successors, (2114) [2025-03-17 00:11:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 9808 transitions. [2025-03-17 00:11:14,844 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 9808 transitions. Word has length 575 [2025-03-17 00:11:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:14,845 INFO L471 AbstractCegarLoop]: Abstraction has 5924 states and 9808 transitions. [2025-03-17 00:11:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 9808 transitions. [2025-03-17 00:11:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:14,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:14,858 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:11:14,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1406392453, now seen corresponding path program 1 times [2025-03-17 00:11:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778052540] [2025-03-17 00:11:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:14,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:14,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:14,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:14,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778052540] [2025-03-17 00:11:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778052540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:11:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317884797] [2025-03-17 00:11:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:11:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:16,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:11:16,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:11:16,151 INFO L87 Difference]: Start difference. First operand 5924 states and 9808 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:21,197 INFO L93 Difference]: Finished difference Result 40494 states and 67058 transitions. [2025-03-17 00:11:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:21,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:21,389 INFO L225 Difference]: With dead ends: 40494 [2025-03-17 00:11:21,389 INFO L226 Difference]: Without dead ends: 34571 [2025-03-17 00:11:21,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:11:21,435 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1877 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1877 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:21,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1877 Valid, 2745 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 00:11:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34571 states. [2025-03-17 00:11:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34571 to 22637. [2025-03-17 00:11:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22637 states, 15508 states have (on average 1.5450090275986588) internal successors, (23960), 15640 states have internal predecessors, (23960), 6980 states have call successors, (6980), 148 states have call predecessors, (6980), 148 states have return successors, (6980), 6848 states have call predecessors, (6980), 6980 states have call successors, (6980) [2025-03-17 00:11:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22637 states to 22637 states and 37920 transitions. [2025-03-17 00:11:23,552 INFO L78 Accepts]: Start accepts. Automaton has 22637 states and 37920 transitions. Word has length 575 [2025-03-17 00:11:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 22637 states and 37920 transitions. [2025-03-17 00:11:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22637 states and 37920 transitions. [2025-03-17 00:11:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:23,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:23,571 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:11:23,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1417708580, now seen corresponding path program 1 times [2025-03-17 00:11:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219006906] [2025-03-17 00:11:23,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:23,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:23,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:23,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:23,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219006906] [2025-03-17 00:11:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219006906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743616904] [2025-03-17 00:11:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:23,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:23,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:23,833 INFO L87 Difference]: Start difference. First operand 22637 states and 37920 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:26,542 INFO L93 Difference]: Finished difference Result 66258 states and 110768 transitions. [2025-03-17 00:11:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:26,764 INFO L225 Difference]: With dead ends: 66258 [2025-03-17 00:11:26,764 INFO L226 Difference]: Without dead ends: 43622 [2025-03-17 00:11:26,852 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-03-17 00:11:26,853 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 232 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:26,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 915 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43622 states. [2025-03-17 00:11:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43622 to 43620. [2025-03-17 00:11:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43620 states, 29363 states have (on average 1.5251847563259886) internal successors, (44784), 29627 states have internal predecessors, (44784), 13960 states have call successors, (13960), 296 states have call predecessors, (13960), 296 states have return successors, (13960), 13696 states have call predecessors, (13960), 13960 states have call successors, (13960) [2025-03-17 00:11:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43620 states to 43620 states and 72704 transitions. [2025-03-17 00:11:30,808 INFO L78 Accepts]: Start accepts. Automaton has 43620 states and 72704 transitions. Word has length 575 [2025-03-17 00:11:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:30,809 INFO L471 AbstractCegarLoop]: Abstraction has 43620 states and 72704 transitions. [2025-03-17 00:11:30,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43620 states and 72704 transitions. [2025-03-17 00:11:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:30,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:30,833 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:30,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:11:30,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:30,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 223045156, now seen corresponding path program 1 times [2025-03-17 00:11:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:30,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446066775] [2025-03-17 00:11:30,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:30,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:30,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:30,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:30,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446066775] [2025-03-17 00:11:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446066775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:11:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362307580] [2025-03-17 00:11:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:11:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:31,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:11:31,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:11:31,205 INFO L87 Difference]: Start difference. First operand 43620 states and 72704 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:35,917 INFO L93 Difference]: Finished difference Result 113113 states and 187112 transitions. [2025-03-17 00:11:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:11:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:36,255 INFO L225 Difference]: With dead ends: 113113 [2025-03-17 00:11:36,256 INFO L226 Difference]: Without dead ends: 69494 [2025-03-17 00:11:36,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:11:36,384 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1064 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:36,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 2552 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:11:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69494 states. [2025-03-17 00:11:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69494 to 65208. [2025-03-17 00:11:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65208 states, 43911 states have (on average 1.5141080822572932) internal successors, (66486), 44335 states have internal predecessors, (66486), 20680 states have call successors, (20680), 616 states have call predecessors, (20680), 616 states have return successors, (20680), 20256 states have call predecessors, (20680), 20680 states have call successors, (20680) [2025-03-17 00:11:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65208 states to 65208 states and 107846 transitions. [2025-03-17 00:11:42,381 INFO L78 Accepts]: Start accepts. Automaton has 65208 states and 107846 transitions. Word has length 575 [2025-03-17 00:11:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:42,382 INFO L471 AbstractCegarLoop]: Abstraction has 65208 states and 107846 transitions. [2025-03-17 00:11:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 65208 states and 107846 transitions. [2025-03-17 00:11:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-17 00:11:42,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:42,412 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 00:11:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:11:42,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 573845093, now seen corresponding path program 1 times [2025-03-17 00:11:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090440918] [2025-03-17 00:11:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:42,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-17 00:11:42,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-17 00:11:42,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:42,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-17 00:11:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:42,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090440918] [2025-03-17 00:11:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090440918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:42,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144652132] [2025-03-17 00:11:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:42,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:42,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:42,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:42,921 INFO L87 Difference]: Start difference. First operand 65208 states and 107846 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-17 00:11:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:48,781 INFO L93 Difference]: Finished difference Result 180715 states and 298378 transitions. [2025-03-17 00:11:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:48,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 575 [2025-03-17 00:11:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:49,296 INFO L225 Difference]: With dead ends: 180715 [2025-03-17 00:11:49,296 INFO L226 Difference]: Without dead ends: 115508 [2025-03-17 00:11:49,485 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-03-17 00:11:49,486 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 239 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:49,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 865 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115508 states.