./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-500_file-57.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 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:20:38,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:20:38,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:20:38,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:20:38,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:20:38,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:20:38,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:20:38,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:20:38,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:20:38,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:20:38,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:20:38,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:20:38,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:20:38,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:20:38,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:20:38,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:20:38,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:38,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:20:38,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:20:38,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:20:38,707 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 -> 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf [2025-03-08 11:20:38,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:20:38,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:20:38,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:20:38,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:20:38,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:20:38,958 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-500_file-57.i [2025-03-08 11:20:40,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891daa779/a832771fd54d4177a7de74d80269adb2/FLAGf486f6ee6 [2025-03-08 11:20:40,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:20:40,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-03-08 11:20:40,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891daa779/a832771fd54d4177a7de74d80269adb2/FLAGf486f6ee6 [2025-03-08 11:20:40,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891daa779/a832771fd54d4177a7de74d80269adb2 [2025-03-08 11:20:40,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:20:40,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:20:40,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:40,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:20:40,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:20:40,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:40,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47934251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40, skipping insertion in model container [2025-03-08 11:20:40,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:40,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:20:40,772 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-500_file-57.i[916,929] [2025-03-08 11:20:40,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:40,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:20:40,910 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-500_file-57.i[916,929] [2025-03-08 11:20:40,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:40,986 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:20:40,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40 WrapperNode [2025-03-08 11:20:40,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:40,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:40,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:20:40,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:20:40,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,070 INFO L138 Inliner]: procedures = 26, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 888 [2025-03-08 11:20:41,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:41,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:20:41,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:20:41,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:20:41,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,126 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-08 11:20:41,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:20:41,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:20:41,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:20:41,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:20:41,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (1/1) ... [2025-03-08 11:20:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:41,212 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-08 11:20:41,219 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-08 11:20:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:20:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:20:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:20:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:20:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:20:41,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:20:41,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:20:41,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:20:42,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc property_#t~bitwise84#1;havoc property_#t~short85#1;havoc property_#t~bitwise86#1;havoc property_#t~short87#1; [2025-03-08 11:20:42,315 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 11:20:42,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:20:42,346 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:20:42,348 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:20:42,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:42 BoogieIcfgContainer [2025-03-08 11:20:42,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:20:42,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:20:42,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:20:42,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:20:42,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:20:40" (1/3) ... [2025-03-08 11:20:42,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:42, skipping insertion in model container [2025-03-08 11:20:42,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:40" (2/3) ... [2025-03-08 11:20:42,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:42, skipping insertion in model container [2025-03-08 11:20:42,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:42" (3/3) ... [2025-03-08 11:20:42,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-03-08 11:20:42,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:20:42,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i that has 2 procedures, 367 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:20:42,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:20:42,439 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;@54c753e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:20:42,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:20:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 11:20:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 11:20:42,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:42,472 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:42,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2111600142, now seen corresponding path program 1 times [2025-03-08 11:20:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715303496] [2025-03-08 11:20:42,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 11:20:42,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 11:20:42,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:42,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2025-03-08 11:20:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715303496] [2025-03-08 11:20:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715303496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:20:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298350381] [2025-03-08 11:20:43,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:43,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:20:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:43,069 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-08 11:20:43,070 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-08 11:20:43,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 11:20:43,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 11:20:43,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:43,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:43,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:20:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:20:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2025-03-08 11:20:43,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:20:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298350381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:20:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:20:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710606566] [2025-03-08 11:20:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:43,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:20:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:43,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:20:43,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:20:43,558 INFO L87 Difference]: Start difference. First operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:43,645 INFO L93 Difference]: Finished difference Result 728 states and 1350 transitions. [2025-03-08 11:20:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:20:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) Word has length 733 [2025-03-08 11:20:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:43,656 INFO L225 Difference]: With dead ends: 728 [2025-03-08 11:20:43,656 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 11:20:43,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 734 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-08 11:20:43,666 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:43,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 11:20:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-08 11:20:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 249 states have (on average 1.5662650602409638) internal successors, (390), 249 states have internal predecessors, (390), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 11:20:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 616 transitions. [2025-03-08 11:20:43,745 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 616 transitions. Word has length 733 [2025-03-08 11:20:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:43,747 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 616 transitions. [2025-03-08 11:20:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 616 transitions. [2025-03-08 11:20:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 11:20:43,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:43,765 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:43,774 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-08 11:20:43,970 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-08 11:20:43,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1351638293, now seen corresponding path program 1 times [2025-03-08 11:20:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445186556] [2025-03-08 11:20:43,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:44,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 11:20:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 11:20:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445186556] [2025-03-08 11:20:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445186556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057420225] [2025-03-08 11:20:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:44,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:44,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:44,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:44,718 INFO L87 Difference]: Start difference. First operand 364 states and 616 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:44,827 INFO L93 Difference]: Finished difference Result 960 states and 1634 transitions. [2025-03-08 11:20:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-03-08 11:20:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:44,833 INFO L225 Difference]: With dead ends: 960 [2025-03-08 11:20:44,833 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 11:20:44,834 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-08 11:20:44,834 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 403 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:44,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1551 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 11:20:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-03-08 11:20:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.6176470588235294) internal successors, (715), 443 states have internal predecessors, (715), 151 states have call successors, (151), 2 states have call predecessors, (151), 2 states have return successors, (151), 150 states have call predecessors, (151), 151 states have call successors, (151) [2025-03-08 11:20:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1017 transitions. [2025-03-08 11:20:44,898 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1017 transitions. Word has length 733 [2025-03-08 11:20:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:44,900 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 1017 transitions. [2025-03-08 11:20:44,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1017 transitions. [2025-03-08 11:20:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 11:20:44,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:44,908 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:44,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:20:44,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 823272692, now seen corresponding path program 1 times [2025-03-08 11:20:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171795322] [2025-03-08 11:20:44,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:44,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 11:20:45,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 11:20:45,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:45,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171795322] [2025-03-08 11:20:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171795322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:45,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:45,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381468914] [2025-03-08 11:20:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:45,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:45,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:45,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:45,321 INFO L87 Difference]: Start difference. First operand 596 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:45,444 INFO L93 Difference]: Finished difference Result 1781 states and 3043 transitions. [2025-03-08 11:20:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:45,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-03-08 11:20:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:45,453 INFO L225 Difference]: With dead ends: 1781 [2025-03-08 11:20:45,453 INFO L226 Difference]: Without dead ends: 1188 [2025-03-08 11:20:45,455 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-08 11:20:45,456 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 594 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:45,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1532 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-08 11:20:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1186. [2025-03-08 11:20:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 879 states have (on average 1.6154721274175199) internal successors, (1420), 881 states have internal predecessors, (1420), 302 states have call successors, (302), 4 states have call predecessors, (302), 4 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-08 11:20:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2024 transitions. [2025-03-08 11:20:45,565 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2024 transitions. Word has length 733 [2025-03-08 11:20:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 2024 transitions. [2025-03-08 11:20:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2024 transitions. [2025-03-08 11:20:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 11:20:45,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:45,577 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:20:45,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1431349555, now seen corresponding path program 1 times [2025-03-08 11:20:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:45,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953680639] [2025-03-08 11:20:45,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:45,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 11:20:45,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 11:20:45,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:45,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953680639] [2025-03-08 11:20:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953680639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206928319] [2025-03-08 11:20:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:46,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:46,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:46,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:46,434 INFO L87 Difference]: Start difference. First operand 1186 states and 2024 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:46,608 INFO L93 Difference]: Finished difference Result 3552 states and 6066 transitions. [2025-03-08 11:20:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-03-08 11:20:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:46,627 INFO L225 Difference]: With dead ends: 3552 [2025-03-08 11:20:46,627 INFO L226 Difference]: Without dead ends: 2369 [2025-03-08 11:20:46,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:46,634 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 393 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:46,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1334 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-08 11:20:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2363. [2025-03-08 11:20:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1750 states have (on average 1.6137142857142857) internal successors, (2824), 1754 states have internal predecessors, (2824), 604 states have call successors, (604), 8 states have call predecessors, (604), 8 states have return successors, (604), 600 states have call predecessors, (604), 604 states have call successors, (604) [2025-03-08 11:20:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 4032 transitions. [2025-03-08 11:20:46,882 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 4032 transitions. Word has length 733 [2025-03-08 11:20:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:46,883 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 4032 transitions. [2025-03-08 11:20:46,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:20:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 4032 transitions. [2025-03-08 11:20:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:20:46,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:46,889 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:20:46,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:46,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1692116495, now seen corresponding path program 1 times [2025-03-08 11:20:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071886806] [2025-03-08 11:20:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:20:46,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:20:46,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:46,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071886806] [2025-03-08 11:20:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071886806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:20:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002801056] [2025-03-08 11:20:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:20:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:47,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:20:47,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:47,837 INFO L87 Difference]: Start difference. First operand 2363 states and 4032 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:48,719 INFO L93 Difference]: Finished difference Result 7790 states and 13315 transitions. [2025-03-08 11:20:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:20:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-03-08 11:20:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:48,754 INFO L225 Difference]: With dead ends: 7790 [2025-03-08 11:20:48,754 INFO L226 Difference]: Without dead ends: 6607 [2025-03-08 11:20:48,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:20:48,762 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1761 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:48,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1622 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:20:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2025-03-08 11:20:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 6599. [2025-03-08 11:20:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 5026 states have (on average 1.6291285316354953) internal successors, (8188), 5042 states have internal predecessors, (8188), 1548 states have call successors, (1548), 24 states have call predecessors, (1548), 24 states have return successors, (1548), 1532 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-03-08 11:20:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 11284 transitions. [2025-03-08 11:20:49,250 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 11284 transitions. Word has length 734 [2025-03-08 11:20:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:49,252 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 11284 transitions. [2025-03-08 11:20:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 11284 transitions. [2025-03-08 11:20:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:20:49,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:49,265 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:49,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:20:49,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1117795250, now seen corresponding path program 1 times [2025-03-08 11:20:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:49,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032723643] [2025-03-08 11:20:49,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:49,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:20:49,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:20:49,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032723643] [2025-03-08 11:20:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032723643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:20:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597556214] [2025-03-08 11:20:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:51,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:20:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:20:51,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:20:51,982 INFO L87 Difference]: Start difference. First operand 6599 states and 11284 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:55,596 INFO L93 Difference]: Finished difference Result 44113 states and 75326 transitions. [2025-03-08 11:20:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:20:55,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-03-08 11:20:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:55,751 INFO L225 Difference]: With dead ends: 44113 [2025-03-08 11:20:55,752 INFO L226 Difference]: Without dead ends: 37517 [2025-03-08 11:20:55,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:20:55,786 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 4109 mSDsluCounter, 4717 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:55,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 5785 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:20:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37517 states. [2025-03-08 11:20:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37517 to 25648. [2025-03-08 11:20:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25648 states, 20206 states have (on average 1.648520241512422) internal successors, (33310), 20279 states have internal predecessors, (33310), 5344 states have call successors, (5344), 97 states have call predecessors, (5344), 97 states have return successors, (5344), 5271 states have call predecessors, (5344), 5344 states have call successors, (5344) [2025-03-08 11:20:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25648 states to 25648 states and 43998 transitions. [2025-03-08 11:20:57,639 INFO L78 Accepts]: Start accepts. Automaton has 25648 states and 43998 transitions. Word has length 734 [2025-03-08 11:20:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:57,640 INFO L471 AbstractCegarLoop]: Abstraction has 25648 states and 43998 transitions. [2025-03-08 11:20:57,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:20:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25648 states and 43998 transitions. [2025-03-08 11:20:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:20:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:57,663 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:20:57,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -552718319, now seen corresponding path program 1 times [2025-03-08 11:20:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959619893] [2025-03-08 11:20:57,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:57,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:20:57,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:20:57,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:57,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:20:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959619893] [2025-03-08 11:20:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959619893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:20:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716442682] [2025-03-08 11:20:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:58,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:20:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:58,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:20:58,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:58,176 INFO L87 Difference]: Start difference. First operand 25648 states and 43998 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-03-08 11:21:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:00,315 INFO L93 Difference]: Finished difference Result 76456 states and 131164 transitions. [2025-03-08 11:21:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) Word has length 734 [2025-03-08 11:21:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:00,530 INFO L225 Difference]: With dead ends: 76456 [2025-03-08 11:21:00,531 INFO L226 Difference]: Without dead ends: 50860 [2025-03-08 11:21:00,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:21:00,619 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1010 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1888 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:00,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1888 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:21:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50860 states. [2025-03-08 11:21:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50860 to 50858. [2025-03-08 11:21:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50858 states, 40004 states have (on average 1.6383361663833618) internal successors, (65540), 40149 states have internal predecessors, (65540), 10660 states have call successors, (10660), 193 states have call predecessors, (10660), 193 states have return successors, (10660), 10515 states have call predecessors, (10660), 10660 states have call successors, (10660) [2025-03-08 11:21:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50858 states to 50858 states and 86860 transitions. [2025-03-08 11:21:03,571 INFO L78 Accepts]: Start accepts. Automaton has 50858 states and 86860 transitions. Word has length 734 [2025-03-08 11:21:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 50858 states and 86860 transitions. [2025-03-08 11:21:03,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-03-08 11:21:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50858 states and 86860 transitions. [2025-03-08 11:21:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:21:03,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:03,605 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:21:03,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 589429649, now seen corresponding path program 1 times [2025-03-08 11:21:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280653101] [2025-03-08 11:21:03,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:03,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:21:03,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:21:03,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:03,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:21:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280653101] [2025-03-08 11:21:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280653101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:21:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391882031] [2025-03-08 11:21:03,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:03,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:21:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:03,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:21:03,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:21:03,863 INFO L87 Difference]: Start difference. First operand 50858 states and 86860 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:21:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:06,891 INFO L93 Difference]: Finished difference Result 134196 states and 229226 transitions. [2025-03-08 11:21:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-03-08 11:21:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:07,192 INFO L225 Difference]: With dead ends: 134196 [2025-03-08 11:21:07,193 INFO L226 Difference]: Without dead ends: 83390 [2025-03-08 11:21:07,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:21:07,314 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 840 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:07,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1312 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:21:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83390 states. [2025-03-08 11:21:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83390 to 83386. [2025-03-08 11:21:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83386 states, 65582 states have (on average 1.635479247354457) internal successors, (107258), 65814 states have internal predecessors, (107258), 17489 states have call successors, (17489), 314 states have call predecessors, (17489), 314 states have return successors, (17489), 17257 states have call predecessors, (17489), 17489 states have call successors, (17489) [2025-03-08 11:21:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83386 states to 83386 states and 142236 transitions. [2025-03-08 11:21:12,281 INFO L78 Accepts]: Start accepts. Automaton has 83386 states and 142236 transitions. Word has length 734 [2025-03-08 11:21:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 83386 states and 142236 transitions. [2025-03-08 11:21:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:21:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 83386 states and 142236 transitions. [2025-03-08 11:21:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:21:12,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:12,332 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:12,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:21:12,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:12,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1542631282, now seen corresponding path program 1 times [2025-03-08 11:21:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856804259] [2025-03-08 11:21:12,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:12,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:21:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:21:12,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:21:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856804259] [2025-03-08 11:21:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856804259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:21:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773245539] [2025-03-08 11:21:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:13,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:21:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:21:13,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:21:13,894 INFO L87 Difference]: Start difference. First operand 83386 states and 142236 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:21:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:18,653 INFO L93 Difference]: Finished difference Result 194287 states and 331225 transitions. [2025-03-08 11:21:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:21:18,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 734 [2025-03-08 11:21:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:19,321 INFO L225 Difference]: With dead ends: 194287 [2025-03-08 11:21:19,321 INFO L226 Difference]: Without dead ends: 143481 [2025-03-08 11:21:19,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:21:19,422 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 3433 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:19,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 3768 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:21:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143481 states. [2025-03-08 11:21:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143481 to 125950. [2025-03-08 11:21:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125950 states, 102170 states have (on average 1.6559263971811686) internal successors, (169186), 102530 states have internal predecessors, (169186), 23273 states have call successors, (23273), 506 states have call predecessors, (23273), 506 states have return successors, (23273), 22913 states have call predecessors, (23273), 23273 states have call successors, (23273) [2025-03-08 11:21:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125950 states to 125950 states and 215732 transitions. [2025-03-08 11:21:26,360 INFO L78 Accepts]: Start accepts. Automaton has 125950 states and 215732 transitions. Word has length 734 [2025-03-08 11:21:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:26,360 INFO L471 AbstractCegarLoop]: Abstraction has 125950 states and 215732 transitions. [2025-03-08 11:21:26,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:21:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 125950 states and 215732 transitions. [2025-03-08 11:21:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 11:21:26,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:26,415 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:21:26,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1157264499, now seen corresponding path program 1 times [2025-03-08 11:21:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738286817] [2025-03-08 11:21:26,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 11:21:26,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 11:21:26,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:21:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738286817] [2025-03-08 11:21:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738286817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:21:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64621847] [2025-03-08 11:21:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:28,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:21:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:28,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:21:28,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:21:28,100 INFO L87 Difference]: Start difference. First operand 125950 states and 215732 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:21:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:34,529 INFO L93 Difference]: Finished difference Result 214643 states and 367343 transitions. [2025-03-08 11:21:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:21:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-03-08 11:21:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:34,996 INFO L225 Difference]: With dead ends: 214643 [2025-03-08 11:21:34,996 INFO L226 Difference]: Without dead ends: 167381 [2025-03-08 11:21:35,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:21:35,110 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 2792 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 4313 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:35,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 4313 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:21:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167381 states. [2025-03-08 11:21:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167381 to 128404. [2025-03-08 11:21:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128404 states, 104624 states have (on average 1.6599250649946475) internal successors, (173668), 104984 states have internal predecessors, (173668), 23273 states have call successors, (23273), 506 states have call predecessors, (23273), 506 states have return successors, (23273), 22913 states have call predecessors, (23273), 23273 states have call successors, (23273) [2025-03-08 11:21:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128404 states to 128404 states and 220214 transitions. [2025-03-08 11:21:42,530 INFO L78 Accepts]: Start accepts. Automaton has 128404 states and 220214 transitions. Word has length 734 [2025-03-08 11:21:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 128404 states and 220214 transitions. [2025-03-08 11:21:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-03-08 11:21:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 128404 states and 220214 transitions. [2025-03-08 11:21:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-03-08 11:21:42,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:42,585 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:42,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:21:42,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1692301294, now seen corresponding path program 1 times [2025-03-08 11:21:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583974961] [2025-03-08 11:21:42,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-03-08 11:21:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-03-08 11:21:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-03-08 11:21:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583974961] [2025-03-08 11:21:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583974961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:42,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:21:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425263643] [2025-03-08 11:21:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:42,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:21:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:42,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:21:42,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:21:42,767 INFO L87 Difference]: Start difference. First operand 128404 states and 220214 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:21:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:47,825 INFO L93 Difference]: Finished difference Result 260569 states and 447345 transitions. [2025-03-08 11:21:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:21:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 735 [2025-03-08 11:21:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:48,214 INFO L225 Difference]: With dead ends: 260569 [2025-03-08 11:21:48,214 INFO L226 Difference]: Without dead ends: 131789 [2025-03-08 11:21:48,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:21:48,393 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 1479 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:48,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2755 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:21:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131789 states. [2025-03-08 11:21:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131789 to 131651. [2025-03-08 11:21:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131651 states, 107871 states have (on average 1.66165141697027) internal successors, (179244), 108231 states have internal predecessors, (179244), 23273 states have call successors, (23273), 506 states have call predecessors, (23273), 506 states have return successors, (23273), 22913 states have call predecessors, (23273), 23273 states have call successors, (23273) [2025-03-08 11:21:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131651 states to 131651 states and 225790 transitions. [2025-03-08 11:21:55,295 INFO L78 Accepts]: Start accepts. Automaton has 131651 states and 225790 transitions. Word has length 735 [2025-03-08 11:21:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:55,296 INFO L471 AbstractCegarLoop]: Abstraction has 131651 states and 225790 transitions. [2025-03-08 11:21:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-03-08 11:21:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 131651 states and 225790 transitions. [2025-03-08 11:21:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-03-08 11:21:55,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:55,352 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:55,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:21:55,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:55,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash 555305392, now seen corresponding path program 1 times [2025-03-08 11:21:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460722231] [2025-03-08 11:21:55,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes.