./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.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 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:31:46,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:31:46,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:31:46,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:31:46,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:31:46,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:31:46,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:31:46,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:31:46,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:31:46,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:31:46,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:31:46,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:31:46,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:31:46,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:31:46,095 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:31:46,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:31:46,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:31:46,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:31:46,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:31:46,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:31:46,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:31:46,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:31:46,098 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 -> 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 [2025-03-17 00:31:46,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:31:46,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:31:46,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:31:46,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:31:46,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:31:46,326 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-91.i [2025-03-17 00:31:47,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebe0ed4f/e67f11e3644448a6a77dee26da98cfc3/FLAG67ddb4a23 [2025-03-17 00:31:47,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:31:47,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-03-17 00:31:47,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebe0ed4f/e67f11e3644448a6a77dee26da98cfc3/FLAG67ddb4a23 [2025-03-17 00:31:48,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebe0ed4f/e67f11e3644448a6a77dee26da98cfc3 [2025-03-17 00:31:48,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:31:48,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:31:48,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:31:48,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:31:48,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:31:48,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283cf62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48, skipping insertion in model container [2025-03-17 00:31:48,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:31:48,214 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-91.i[916,929] [2025-03-17 00:31:48,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:31:48,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:31:48,356 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-91.i[916,929] [2025-03-17 00:31:48,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:31:48,444 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:31:48,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48 WrapperNode [2025-03-17 00:31:48,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:31:48,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:31:48,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:31:48,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:31:48,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,523 INFO L138 Inliner]: procedures = 26, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 901 [2025-03-17 00:31:48,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:31:48,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:31:48,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:31:48,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:31:48,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,571 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:31:48,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:31:48,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:31:48,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:31:48,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:31:48,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (1/1) ... [2025-03-17 00:31:48,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:31:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:31:48,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:31:48,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:31:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:31:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:31:48,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:31:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:31:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:31:48,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:31:48,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:31:48,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:31:49,899 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 00:31:49,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:31:49,931 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:31:49,932 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 00:31:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:31:49 BoogieIcfgContainer [2025-03-17 00:31:49,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:31:49,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:31:49,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:31:49,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:31:49,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:31:48" (1/3) ... [2025-03-17 00:31:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:31:49, skipping insertion in model container [2025-03-17 00:31:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:31:48" (2/3) ... [2025-03-17 00:31:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:31:49, skipping insertion in model container [2025-03-17 00:31:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:31:49" (3/3) ... [2025-03-17 00:31:49,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-03-17 00:31:49,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:31:49,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i that has 2 procedures, 370 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:31:50,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:31:50,024 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;@2c22a918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:31:50,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:31:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 370 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 237 states have internal predecessors, (366), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-17 00:31:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-17 00:31:50,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:50,061 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:50,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -33441703, now seen corresponding path program 1 times [2025-03-17 00:31:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421344887] [2025-03-17 00:31:50,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:50,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-17 00:31:50,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-17 00:31:50,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:50,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-03-17 00:31:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421344887] [2025-03-17 00:31:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421344887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:31:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599947662] [2025-03-17 00:31:50,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:31:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:31:50,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:31:50,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:31:50,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-17 00:31:51,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-17 00:31:51,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:51,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:51,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:31:51,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:31:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-03-17 00:31:51,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:31:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599947662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:31:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:31:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804372791] [2025-03-17 00:31:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:51,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:31:51,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:51,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:31:51,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:31:51,287 INFO L87 Difference]: Start difference. First operand has 370 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 237 states have internal predecessors, (366), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:31:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:51,379 INFO L93 Difference]: Finished difference Result 737 states and 1385 transitions. [2025-03-17 00:31:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:31:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) Word has length 815 [2025-03-17 00:31:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:51,392 INFO L225 Difference]: With dead ends: 737 [2025-03-17 00:31:51,392 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 00:31:51,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:31:51,400 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:51,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:31:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 00:31:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-17 00:31:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 235 states have (on average 1.5191489361702128) internal successors, (357), 235 states have internal predecessors, (357), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-17 00:31:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 619 transitions. [2025-03-17 00:31:51,498 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 619 transitions. Word has length 815 [2025-03-17 00:31:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:51,500 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 619 transitions. [2025-03-17 00:31:51,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:31:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 619 transitions. [2025-03-17 00:31:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-17 00:31:51,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:51,521 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:51,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:31:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:31:51,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 970300560, now seen corresponding path program 1 times [2025-03-17 00:31:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437552935] [2025-03-17 00:31:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:51,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-17 00:31:51,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-17 00:31:51,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:51,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437552935] [2025-03-17 00:31:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437552935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:52,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794284369] [2025-03-17 00:31:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:52,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:52,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:52,606 INFO L87 Difference]: Start difference. First operand 368 states and 619 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:52,712 INFO L93 Difference]: Finished difference Result 931 states and 1574 transitions. [2025-03-17 00:31:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:52,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 815 [2025-03-17 00:31:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:52,722 INFO L225 Difference]: With dead ends: 931 [2025-03-17 00:31:52,724 INFO L226 Difference]: Without dead ends: 564 [2025-03-17 00:31:52,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:52,726 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 323 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:52,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1260 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-17 00:31:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2025-03-17 00:31:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 403 states have (on average 1.5930521091811414) internal successors, (642), 404 states have internal predecessors, (642), 155 states have call successors, (155), 2 states have call predecessors, (155), 2 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-17 00:31:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 952 transitions. [2025-03-17 00:31:52,804 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 952 transitions. Word has length 815 [2025-03-17 00:31:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 952 transitions. [2025-03-17 00:31:52,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 952 transitions. [2025-03-17 00:31:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-17 00:31:52,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:52,819 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:52,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:31:52,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:52,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1649266866, now seen corresponding path program 1 times [2025-03-17 00:31:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853361204] [2025-03-17 00:31:52,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-17 00:31:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-17 00:31:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:53,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853361204] [2025-03-17 00:31:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853361204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:53,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394452340] [2025-03-17 00:31:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:53,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:53,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:53,216 INFO L87 Difference]: Start difference. First operand 561 states and 952 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:53,322 INFO L93 Difference]: Finished difference Result 1485 states and 2520 transitions. [2025-03-17 00:31:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 815 [2025-03-17 00:31:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:53,334 INFO L225 Difference]: With dead ends: 1485 [2025-03-17 00:31:53,334 INFO L226 Difference]: Without dead ends: 925 [2025-03-17 00:31:53,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:53,338 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 316 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:53,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1296 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-17 00:31:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2025-03-17 00:31:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 696 states have (on average 1.6077586206896552) internal successors, (1119), 699 states have internal predecessors, (1119), 221 states have call successors, (221), 4 states have call predecessors, (221), 4 states have return successors, (221), 218 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-17 00:31:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1561 transitions. [2025-03-17 00:31:53,427 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1561 transitions. Word has length 815 [2025-03-17 00:31:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:53,447 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1561 transitions. [2025-03-17 00:31:53,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1561 transitions. [2025-03-17 00:31:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-17 00:31:53,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:53,456 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:31:53,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:53,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1018808241, now seen corresponding path program 1 times [2025-03-17 00:31:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:53,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982831617] [2025-03-17 00:31:53,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:53,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-17 00:31:53,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-17 00:31:53,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:53,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982831617] [2025-03-17 00:31:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982831617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:53,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:31:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627939096] [2025-03-17 00:31:53,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:53,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:31:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:31:54,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:54,000 INFO L87 Difference]: Start difference. First operand 922 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:54,148 INFO L93 Difference]: Finished difference Result 2435 states and 4118 transitions. [2025-03-17 00:31:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:31:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 815 [2025-03-17 00:31:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:54,160 INFO L225 Difference]: With dead ends: 2435 [2025-03-17 00:31:54,160 INFO L226 Difference]: Without dead ends: 1514 [2025-03-17 00:31:54,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:54,163 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 279 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:54,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 2006 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-03-17 00:31:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1507. [2025-03-17 00:31:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1139 states have (on average 1.5996488147497805) internal successors, (1822), 1146 states have internal predecessors, (1822), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-17 00:31:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2540 transitions. [2025-03-17 00:31:54,242 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2540 transitions. Word has length 815 [2025-03-17 00:31:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2540 transitions. [2025-03-17 00:31:54,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2540 transitions. [2025-03-17 00:31:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2025-03-17 00:31:54,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:54,249 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:54,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:31:54,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1399907462, now seen corresponding path program 1 times [2025-03-17 00:31:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809263740] [2025-03-17 00:31:54,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:54,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 816 statements into 1 equivalence classes. [2025-03-17 00:31:54,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 816 of 816 statements. [2025-03-17 00:31:54,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:54,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809263740] [2025-03-17 00:31:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809263740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:54,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:54,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:31:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662393711] [2025-03-17 00:31:54,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:31:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:54,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:31:54,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:54,692 INFO L87 Difference]: Start difference. First operand 1507 states and 2540 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:55,546 INFO L93 Difference]: Finished difference Result 5564 states and 9357 transitions. [2025-03-17 00:31:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:31:55,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 816 [2025-03-17 00:31:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:55,567 INFO L225 Difference]: With dead ends: 5564 [2025-03-17 00:31:55,568 INFO L226 Difference]: Without dead ends: 4058 [2025-03-17 00:31:55,572 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-17 00:31:55,573 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 651 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:55,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1527 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:31:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-03-17 00:31:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4053. [2025-03-17 00:31:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 2995 states have (on average 1.5829716193656094) internal successors, (4741), 3017 states have internal predecessors, (4741), 1033 states have call successors, (1033), 24 states have call predecessors, (1033), 24 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-03-17 00:31:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6807 transitions. [2025-03-17 00:31:55,834 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6807 transitions. Word has length 816 [2025-03-17 00:31:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:55,835 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 6807 transitions. [2025-03-17 00:31:55,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6807 transitions. [2025-03-17 00:31:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:31:55,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:55,843 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:31:55,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -558629368, now seen corresponding path program 1 times [2025-03-17 00:31:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114437317] [2025-03-17 00:31:55,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:55,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:31:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:31:55,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114437317] [2025-03-17 00:31:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114437317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:56,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326180153] [2025-03-17 00:31:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:56,104 INFO L87 Difference]: Start difference. First operand 4053 states and 6807 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:56,443 INFO L93 Difference]: Finished difference Result 11471 states and 19274 transitions. [2025-03-17 00:31:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:31:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:56,491 INFO L225 Difference]: With dead ends: 11471 [2025-03-17 00:31:56,491 INFO L226 Difference]: Without dead ends: 7419 [2025-03-17 00:31:56,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:56,508 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 279 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:56,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1270 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2025-03-17 00:31:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7405. [2025-03-17 00:31:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7405 states, 5675 states have (on average 1.5938325991189428) internal successors, (9045), 5721 states have internal predecessors, (9045), 1681 states have call successors, (1681), 48 states have call predecessors, (1681), 48 states have return successors, (1681), 1635 states have call predecessors, (1681), 1681 states have call successors, (1681) [2025-03-17 00:31:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 12407 transitions. [2025-03-17 00:31:56,912 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 12407 transitions. Word has length 817 [2025-03-17 00:31:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:56,914 INFO L471 AbstractCegarLoop]: Abstraction has 7405 states and 12407 transitions. [2025-03-17 00:31:56,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 12407 transitions. [2025-03-17 00:31:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:31:56,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:56,930 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:56,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:31:56,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -545096567, now seen corresponding path program 1 times [2025-03-17 00:31:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249395777] [2025-03-17 00:31:56,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:56,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:31:56,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:31:57,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:57,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249395777] [2025-03-17 00:31:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249395777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612170078] [2025-03-17 00:31:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:57,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:57,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:57,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:57,164 INFO L87 Difference]: Start difference. First operand 7405 states and 12407 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:57,468 INFO L93 Difference]: Finished difference Result 14871 states and 24862 transitions. [2025-03-17 00:31:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:31:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:57,516 INFO L225 Difference]: With dead ends: 14871 [2025-03-17 00:31:57,516 INFO L226 Difference]: Without dead ends: 7467 [2025-03-17 00:31:57,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:57,539 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 272 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:57,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-03-17 00:31:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 5641. [2025-03-17 00:31:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 4571 states have (on average 1.6103697221614526) internal successors, (7361), 4593 states have internal predecessors, (7361), 1033 states have call successors, (1033), 36 states have call predecessors, (1033), 36 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-03-17 00:31:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9427 transitions. [2025-03-17 00:31:57,846 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9427 transitions. Word has length 817 [2025-03-17 00:31:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:57,847 INFO L471 AbstractCegarLoop]: Abstraction has 5641 states and 9427 transitions. [2025-03-17 00:31:57,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9427 transitions. [2025-03-17 00:31:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:31:57,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:57,858 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:31:57,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -514076760, now seen corresponding path program 1 times [2025-03-17 00:31:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91742997] [2025-03-17 00:31:57,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:31:57,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:31:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91742997] [2025-03-17 00:31:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91742997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744973933] [2025-03-17 00:31:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:58,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:58,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:58,080 INFO L87 Difference]: Start difference. First operand 5641 states and 9427 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:58,525 INFO L93 Difference]: Finished difference Result 16921 states and 28279 transitions. [2025-03-17 00:31:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:31:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:58,584 INFO L225 Difference]: With dead ends: 16921 [2025-03-17 00:31:58,584 INFO L226 Difference]: Without dead ends: 11281 [2025-03-17 00:31:58,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:58,606 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 613 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:58,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1755 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11281 states. [2025-03-17 00:31:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11281 to 11263. [2025-03-17 00:31:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11263 states, 9124 states have (on average 1.6036825953529155) internal successors, (14632), 9168 states have internal predecessors, (14632), 2066 states have call successors, (2066), 72 states have call predecessors, (2066), 72 states have return successors, (2066), 2022 states have call predecessors, (2066), 2066 states have call successors, (2066) [2025-03-17 00:31:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 18764 transitions. [2025-03-17 00:31:59,259 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 18764 transitions. Word has length 817 [2025-03-17 00:31:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:59,260 INFO L471 AbstractCegarLoop]: Abstraction has 11263 states and 18764 transitions. [2025-03-17 00:31:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 18764 transitions. [2025-03-17 00:31:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:31:59,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:59,270 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:31:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:31:59,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1523979529, now seen corresponding path program 1 times [2025-03-17 00:31:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682525419] [2025-03-17 00:31:59,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:59,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:31:59,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:31:59,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:59,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:31:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682525419] [2025-03-17 00:31:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682525419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:59,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:59,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519843688] [2025-03-17 00:31:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:59,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:59,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:59,475 INFO L87 Difference]: Start difference. First operand 11263 states and 18764 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:31:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:59,987 INFO L93 Difference]: Finished difference Result 33211 states and 55250 transitions. [2025-03-17 00:31:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:59,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:31:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:00,073 INFO L225 Difference]: With dead ends: 33211 [2025-03-17 00:32:00,074 INFO L226 Difference]: Without dead ends: 21949 [2025-03-17 00:32:00,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:00,111 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:00,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1540 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:32:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21949 states. [2025-03-17 00:32:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21949 to 17271. [2025-03-17 00:32:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17271 states, 15132 states have (on average 1.6315093840867037) internal successors, (24688), 15176 states have internal predecessors, (24688), 2066 states have call successors, (2066), 72 states have call predecessors, (2066), 72 states have return successors, (2066), 2022 states have call predecessors, (2066), 2066 states have call successors, (2066) [2025-03-17 00:32:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17271 states to 17271 states and 28820 transitions. [2025-03-17 00:32:00,835 INFO L78 Accepts]: Start accepts. Automaton has 17271 states and 28820 transitions. Word has length 817 [2025-03-17 00:32:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:00,836 INFO L471 AbstractCegarLoop]: Abstraction has 17271 states and 28820 transitions. [2025-03-17 00:32:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17271 states and 28820 transitions. [2025-03-17 00:32:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:32:00,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:00,851 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:32:00,851 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1115155304, now seen corresponding path program 1 times [2025-03-17 00:32:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017285526] [2025-03-17 00:32:00,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:00,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:32:00,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:32:00,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017285526] [2025-03-17 00:32:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017285526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:32:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117900563] [2025-03-17 00:32:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:32:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:32:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:01,077 INFO L87 Difference]: Start difference. First operand 17271 states and 28820 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:32:01,807 INFO L93 Difference]: Finished difference Result 43495 states and 72456 transitions. [2025-03-17 00:32:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:32:01,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:32:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:01,902 INFO L225 Difference]: With dead ends: 43495 [2025-03-17 00:32:01,902 INFO L226 Difference]: Without dead ends: 26225 [2025-03-17 00:32:01,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:01,946 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 261 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:01,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1263 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:32:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26225 states. [2025-03-17 00:32:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26225 to 26175. [2025-03-17 00:32:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26175 states, 22932 states have (on average 1.6274201988487702) internal successors, (37320), 23024 states have internal predecessors, (37320), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-03-17 00:32:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26175 states to 26175 states and 43564 transitions. [2025-03-17 00:32:03,060 INFO L78 Accepts]: Start accepts. Automaton has 26175 states and 43564 transitions. Word has length 817 [2025-03-17 00:32:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 26175 states and 43564 transitions. [2025-03-17 00:32:03,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26175 states and 43564 transitions. [2025-03-17 00:32:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-17 00:32:03,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:03,082 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:03,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:32:03,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1826502295, now seen corresponding path program 1 times [2025-03-17 00:32:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580996903] [2025-03-17 00:32:03,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:03,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-17 00:32:03,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-17 00:32:03,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:03,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:03,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:03,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580996903] [2025-03-17 00:32:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580996903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:32:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315474725] [2025-03-17 00:32:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:03,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:32:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:03,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:32:03,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:03,286 INFO L87 Difference]: Start difference. First operand 26175 states and 43564 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:32:04,236 INFO L93 Difference]: Finished difference Result 78235 states and 130114 transitions. [2025-03-17 00:32:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:32:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 817 [2025-03-17 00:32:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:04,412 INFO L225 Difference]: With dead ends: 78235 [2025-03-17 00:32:04,412 INFO L226 Difference]: Without dead ends: 52061 [2025-03-17 00:32:04,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:04,470 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 611 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:04,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1784 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:32:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52061 states. [2025-03-17 00:32:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52061 to 26367. [2025-03-17 00:32:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26367 states, 23124 states have (on average 1.6222106901920084) internal successors, (37512), 23216 states have internal predecessors, (37512), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-03-17 00:32:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26367 states to 26367 states and 43756 transitions. [2025-03-17 00:32:05,718 INFO L78 Accepts]: Start accepts. Automaton has 26367 states and 43756 transitions. Word has length 817 [2025-03-17 00:32:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 26367 states and 43756 transitions. [2025-03-17 00:32:05,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 26367 states and 43756 transitions. [2025-03-17 00:32:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-17 00:32:05,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:05,744 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:05,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:32:05,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:05,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1934651837, now seen corresponding path program 1 times [2025-03-17 00:32:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473887325] [2025-03-17 00:32:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:05,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-17 00:32:05,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-17 00:32:05,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:05,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473887325] [2025-03-17 00:32:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473887325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:32:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154211051] [2025-03-17 00:32:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:32:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:06,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:32:06,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:32:06,415 INFO L87 Difference]: Start difference. First operand 26367 states and 43756 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:32:09,330 INFO L93 Difference]: Finished difference Result 95781 states and 158109 transitions. [2025-03-17 00:32:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:32:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 818 [2025-03-17 00:32:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:09,527 INFO L225 Difference]: With dead ends: 95781 [2025-03-17 00:32:09,527 INFO L226 Difference]: Without dead ends: 69415 [2025-03-17 00:32:09,593 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-17 00:32:09,594 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 611 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:09,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1456 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:32:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69415 states. [2025-03-17 00:32:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69415 to 31863. [2025-03-17 00:32:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31863 states, 28620 states have (on average 1.631027253668763) internal successors, (46680), 28712 states have internal predecessors, (46680), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-03-17 00:32:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31863 states to 31863 states and 52924 transitions. [2025-03-17 00:32:10,993 INFO L78 Accepts]: Start accepts. Automaton has 31863 states and 52924 transitions. Word has length 818 [2025-03-17 00:32:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 31863 states and 52924 transitions. [2025-03-17 00:32:10,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 31863 states and 52924 transitions. [2025-03-17 00:32:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-17 00:32:11,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:11,015 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:11,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:32:11,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1666922754, now seen corresponding path program 1 times [2025-03-17 00:32:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756581621] [2025-03-17 00:32:11,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-17 00:32:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-17 00:32:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756581621] [2025-03-17 00:32:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756581621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:32:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052540644] [2025-03-17 00:32:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:32:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:32:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:11,603 INFO L87 Difference]: Start difference. First operand 31863 states and 52924 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:32:12,457 INFO L93 Difference]: Finished difference Result 79705 states and 132465 transitions. [2025-03-17 00:32:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:32:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 818 [2025-03-17 00:32:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:12,598 INFO L225 Difference]: With dead ends: 79705 [2025-03-17 00:32:12,598 INFO L226 Difference]: Without dead ends: 47843 [2025-03-17 00:32:12,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:32:12,668 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 345 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:12,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:32:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47843 states. [2025-03-17 00:32:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47843 to 47745. [2025-03-17 00:32:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47745 states, 42881 states have (on average 1.62922972878431) internal successors, (69863), 43019 states have internal predecessors, (69863), 4683 states have call successors, (4683), 180 states have call predecessors, (4683), 180 states have return successors, (4683), 4545 states have call predecessors, (4683), 4683 states have call successors, (4683) [2025-03-17 00:32:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47745 states to 47745 states and 79229 transitions. [2025-03-17 00:32:14,823 INFO L78 Accepts]: Start accepts. Automaton has 47745 states and 79229 transitions. Word has length 818 [2025-03-17 00:32:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:14,825 INFO L471 AbstractCegarLoop]: Abstraction has 47745 states and 79229 transitions. [2025-03-17 00:32:14,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-17 00:32:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 47745 states and 79229 transitions. [2025-03-17 00:32:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-17 00:32:14,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:14,862 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:32:14,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1767745981, now seen corresponding path program 1 times [2025-03-17 00:32:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650058911] [2025-03-17 00:32:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-17 00:32:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-17 00:32:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650058911] [2025-03-17 00:32:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650058911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:32:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863334488] [2025-03-17 00:32:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:15,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:32:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:15,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:32:15,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:32:15,938 INFO L87 Difference]: Start difference. First operand 47745 states and 79229 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:32:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:32:20,433 INFO L93 Difference]: Finished difference Result 145359 states and 239822 transitions. [2025-03-17 00:32:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:32:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 818 [2025-03-17 00:32:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:32:20,768 INFO L225 Difference]: With dead ends: 145359 [2025-03-17 00:32:20,769 INFO L226 Difference]: Without dead ends: 97615 [2025-03-17 00:32:20,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-17 00:32:20,892 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 726 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:32:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2705 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:32:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97615 states. [2025-03-17 00:32:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97615 to 92571. [2025-03-17 00:32:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92571 states, 81311 states have (on average 1.6048628106898206) internal successors, (130493), 81635 states have internal predecessors, (130493), 10839 states have call successors, (10839), 420 states have call predecessors, (10839), 420 states have return successors, (10839), 10515 states have call predecessors, (10839), 10839 states have call successors, (10839) [2025-03-17 00:32:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92571 states to 92571 states and 152171 transitions. [2025-03-17 00:32:25,181 INFO L78 Accepts]: Start accepts. Automaton has 92571 states and 152171 transitions. Word has length 818 [2025-03-17 00:32:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:32:25,182 INFO L471 AbstractCegarLoop]: Abstraction has 92571 states and 152171 transitions. [2025-03-17 00:32:25,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:32:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 92571 states and 152171 transitions. [2025-03-17 00:32:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-17 00:32:25,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:32:25,229 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:32:25,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:32:25,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:32:25,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:32:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash 601049662, now seen corresponding path program 1 times [2025-03-17 00:32:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:32:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489993157] [2025-03-17 00:32:25,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:32:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:32:25,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-17 00:32:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-17 00:32:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:32:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:32:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-17 00:32:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:32:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489993157] [2025-03-17 00:32:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489993157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:32:27,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:32:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:32:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170838518] [2025-03-17 00:32:27,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:32:27,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:32:27,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:32:27,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:32:27,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:32:27,314 INFO L87 Difference]: Start difference. First operand 92571 states and 152171 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 3 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 3 states have call predecessors, (131), 3 states have call successors, (131) [2025-03-17 00:33:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:33:00,903 INFO L93 Difference]: Finished difference Result 816201 states and 1336247 transitions. [2025-03-17 00:33:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:33:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 3 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 3 states have call predecessors, (131), 3 states have call successors, (131) Word has length 818 [2025-03-17 00:33:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted.