./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-69.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 10a5b91e206caf05061e8827c7f121f08b981a096162c865ff7d0b016f9308fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:18,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:18,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:18,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:18,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:19,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:19,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:19,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:19,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:19,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:19,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:19,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:19,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:19,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:19,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:19,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:19,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:19,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:19,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:19,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:19,010 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 -> 10a5b91e206caf05061e8827c7f121f08b981a096162c865ff7d0b016f9308fd [2025-03-03 20:10:19,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:19,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:19,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:19,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:19,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:19,240 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-69.i [2025-03-03 20:10:20,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82ecd56b/b453054d9b154aab8300a86ba29becc9/FLAG685fdcc21 [2025-03-03 20:10:20,641 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:20,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-69.i [2025-03-03 20:10:20,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82ecd56b/b453054d9b154aab8300a86ba29becc9/FLAG685fdcc21 [2025-03-03 20:10:20,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82ecd56b/b453054d9b154aab8300a86ba29becc9 [2025-03-03 20:10:20,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:20,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:20,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:20,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:20,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:20,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:20" (1/1) ... [2025-03-03 20:10:20,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:20, skipping insertion in model container [2025-03-03 20:10:20,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:20" (1/1) ... [2025-03-03 20:10:20,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:21,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-69.i[916,929] [2025-03-03 20:10:21,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:21,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:21,238 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-69.i[916,929] [2025-03-03 20:10:21,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:21,329 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:21,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21 WrapperNode [2025-03-03 20:10:21,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:21,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:21,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:21,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:21,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,401 INFO L138 Inliner]: procedures = 26, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 832 [2025-03-03 20:10:21,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:21,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:21,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:21,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:21,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,458 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-03 20:10:21,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:21,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:21,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:21,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:21,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:21,548 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-03 20:10:21,553 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-03 20:10:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:21,699 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:21,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:22,593 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:22,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:22,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:22,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:10:22,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:22 BoogieIcfgContainer [2025-03-03 20:10:22,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:22,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:22,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:22,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:22,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:20" (1/3) ... [2025-03-03 20:10:22,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6861bb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:22, skipping insertion in model container [2025-03-03 20:10:22,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (2/3) ... [2025-03-03 20:10:22,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6861bb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:22, skipping insertion in model container [2025-03-03 20:10:22,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:22" (3/3) ... [2025-03-03 20:10:22,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-69.i [2025-03-03 20:10:22,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:22,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-69.i that has 2 procedures, 349 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:22,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:22,711 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;@158b55e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:22,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 223 states have internal predecessors, (348), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 20:10:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-03-03 20:10:22,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:22,753 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:22,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 645424218, now seen corresponding path program 1 times [2025-03-03 20:10:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908781728] [2025-03-03 20:10:22,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-03 20:10:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-03 20:10:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2025-03-03 20:10:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908781728] [2025-03-03 20:10:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908781728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559772180] [2025-03-03 20:10:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:23,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:23,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:23,345 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-03 20:10:23,346 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-03 20:10:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-03 20:10:23,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-03 20:10:23,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:23,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:23,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:23,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2025-03-03 20:10:23,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559772180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:23,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:23,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811656135] [2025-03-03 20:10:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:23,813 INFO L87 Difference]: Start difference. First operand has 349 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 223 states have internal predecessors, (348), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) [2025-03-03 20:10:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:23,883 INFO L93 Difference]: Finished difference Result 692 states and 1311 transitions. [2025-03-03 20:10:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) Word has length 775 [2025-03-03 20:10:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:23,896 INFO L225 Difference]: With dead ends: 692 [2025-03-03 20:10:23,896 INFO L226 Difference]: Without dead ends: 346 [2025-03-03 20:10:23,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 776 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-03 20:10:23,907 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:23,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-03 20:10:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-03 20:10:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 220 states have (on average 1.55) internal successors, (341), 220 states have internal predecessors, (341), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 20:10:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 589 transitions. [2025-03-03 20:10:23,993 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 589 transitions. Word has length 775 [2025-03-03 20:10:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:23,994 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 589 transitions. [2025-03-03 20:10:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) [2025-03-03 20:10:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 589 transitions. [2025-03-03 20:10:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-03-03 20:10:24,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:24,009 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:24,018 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-03 20:10:24,214 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-03 20:10:24,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:24,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash -768713672, now seen corresponding path program 1 times [2025-03-03 20:10:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:24,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403245020] [2025-03-03 20:10:24,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-03 20:10:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-03 20:10:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:24,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403245020] [2025-03-03 20:10:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403245020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138288326] [2025-03-03 20:10:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:24,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:24,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:24,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:24,922 INFO L87 Difference]: Start difference. First operand 346 states and 589 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:25,036 INFO L93 Difference]: Finished difference Result 879 states and 1507 transitions. [2025-03-03 20:10:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:25,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-03-03 20:10:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:25,047 INFO L225 Difference]: With dead ends: 879 [2025-03-03 20:10:25,047 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 20:10:25,048 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-03 20:10:25,049 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 320 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:25,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1246 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 20:10:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-03-03 20:10:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 377 states have (on average 1.6047745358090186) internal successors, (605), 378 states have internal predecessors, (605), 153 states have call successors, (153), 2 states have call predecessors, (153), 2 states have return successors, (153), 152 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-03 20:10:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 911 transitions. [2025-03-03 20:10:25,125 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 911 transitions. Word has length 775 [2025-03-03 20:10:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:25,126 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 911 transitions. [2025-03-03 20:10:25,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 911 transitions. [2025-03-03 20:10:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-03-03 20:10:25,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:25,138 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:25,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:25,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 439204503, now seen corresponding path program 1 times [2025-03-03 20:10:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096534115] [2025-03-03 20:10:25,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:25,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-03 20:10:25,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-03 20:10:25,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:25,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096534115] [2025-03-03 20:10:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096534115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209781087] [2025-03-03 20:10:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:25,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:25,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:25,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:25,573 INFO L87 Difference]: Start difference. First operand 533 states and 911 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:25,737 INFO L93 Difference]: Finished difference Result 1593 states and 2727 transitions. [2025-03-03 20:10:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-03-03 20:10:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:25,753 INFO L225 Difference]: With dead ends: 1593 [2025-03-03 20:10:25,753 INFO L226 Difference]: Without dead ends: 1063 [2025-03-03 20:10:25,757 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-03 20:10:25,759 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 580 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:25,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1691 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-03 20:10:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1060. [2025-03-03 20:10:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 749 states have (on average 1.60347129506008) internal successors, (1201), 751 states have internal predecessors, (1201), 306 states have call successors, (306), 4 states have call predecessors, (306), 4 states have return successors, (306), 304 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-03 20:10:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1813 transitions. [2025-03-03 20:10:25,919 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1813 transitions. Word has length 775 [2025-03-03 20:10:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1813 transitions. [2025-03-03 20:10:25,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1813 transitions. [2025-03-03 20:10:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-03-03 20:10:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:25,926 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:25,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 452737304, now seen corresponding path program 1 times [2025-03-03 20:10:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048204491] [2025-03-03 20:10:25,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:25,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-03 20:10:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-03 20:10:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:26,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048204491] [2025-03-03 20:10:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048204491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:26,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852302428] [2025-03-03 20:10:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:26,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:26,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:26,347 INFO L87 Difference]: Start difference. First operand 1060 states and 1813 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:26,465 INFO L93 Difference]: Finished difference Result 2637 states and 4513 transitions. [2025-03-03 20:10:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-03-03 20:10:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:26,477 INFO L225 Difference]: With dead ends: 2637 [2025-03-03 20:10:26,478 INFO L226 Difference]: Without dead ends: 1580 [2025-03-03 20:10:26,481 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-03 20:10:26,482 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 369 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:26,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1352 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-03 20:10:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2025-03-03 20:10:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1111 states have (on average 1.5976597659765976) internal successors, (1775), 1114 states have internal predecessors, (1775), 459 states have call successors, (459), 6 states have call predecessors, (459), 6 states have return successors, (459), 456 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-03 20:10:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2693 transitions. [2025-03-03 20:10:26,608 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2693 transitions. Word has length 775 [2025-03-03 20:10:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:26,610 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2693 transitions. [2025-03-03 20:10:26,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2693 transitions. [2025-03-03 20:10:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-03 20:10:26,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:26,618 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:26,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1829267897, now seen corresponding path program 1 times [2025-03-03 20:10:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181832818] [2025-03-03 20:10:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:26,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-03 20:10:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-03 20:10:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181832818] [2025-03-03 20:10:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181832818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540423952] [2025-03-03 20:10:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:26,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:26,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:26,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:26,963 INFO L87 Difference]: Start difference. First operand 1577 states and 2693 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:27,300 INFO L93 Difference]: Finished difference Result 4272 states and 7284 transitions. [2025-03-03 20:10:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 777 [2025-03-03 20:10:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,315 INFO L225 Difference]: With dead ends: 4272 [2025-03-03 20:10:27,317 INFO L226 Difference]: Without dead ends: 2698 [2025-03-03 20:10:27,321 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-03 20:10:27,322 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 732 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2779 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:10:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-03 20:10:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2140. [2025-03-03 20:10:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1617 states have (on average 1.6221397649969078) internal successors, (2623), 1620 states have internal predecessors, (2623), 510 states have call successors, (510), 12 states have call predecessors, (510), 12 states have return successors, (510), 507 states have call predecessors, (510), 510 states have call successors, (510) [2025-03-03 20:10:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 3643 transitions. [2025-03-03 20:10:27,463 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 3643 transitions. Word has length 777 [2025-03-03 20:10:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 3643 transitions. [2025-03-03 20:10:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3643 transitions. [2025-03-03 20:10:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-03 20:10:27,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:27,475 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:27,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -447763431, now seen corresponding path program 1 times [2025-03-03 20:10:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558146701] [2025-03-03 20:10:27,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:27,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:10:27,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:10:27,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:27,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:27,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558146701] [2025-03-03 20:10:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558146701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136504715] [2025-03-03 20:10:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:27,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:27,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:27,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:27,786 INFO L87 Difference]: Start difference. First operand 2140 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:27,963 INFO L93 Difference]: Finished difference Result 6384 states and 10863 transitions. [2025-03-03 20:10:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 778 [2025-03-03 20:10:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,987 INFO L225 Difference]: With dead ends: 6384 [2025-03-03 20:10:27,987 INFO L226 Difference]: Without dead ends: 4247 [2025-03-03 20:10:27,995 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-03 20:10:27,996 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 558 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1542 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2025-03-03 20:10:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4245. [2025-03-03 20:10:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4245 states, 3200 states have (on average 1.60625) internal successors, (5140), 3206 states have internal predecessors, (5140), 1020 states have call successors, (1020), 24 states have call predecessors, (1020), 24 states have return successors, (1020), 1014 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-03 20:10:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 7180 transitions. [2025-03-03 20:10:28,225 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 7180 transitions. Word has length 778 [2025-03-03 20:10:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:28,227 INFO L471 AbstractCegarLoop]: Abstraction has 4245 states and 7180 transitions. [2025-03-03 20:10:28,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 7180 transitions. [2025-03-03 20:10:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:28,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:28,235 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:28,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -859451109, now seen corresponding path program 1 times [2025-03-03 20:10:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570446969] [2025-03-03 20:10:28,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:28,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:28,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570446969] [2025-03-03 20:10:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570446969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835605131] [2025-03-03 20:10:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:28,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:28,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:28,477 INFO L87 Difference]: Start difference. First operand 4245 states and 7180 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:28,700 INFO L93 Difference]: Finished difference Result 11189 states and 18882 transitions. [2025-03-03 20:10:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:28,740 INFO L225 Difference]: With dead ends: 11189 [2025-03-03 20:10:28,740 INFO L226 Difference]: Without dead ends: 6947 [2025-03-03 20:10:28,754 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-03 20:10:28,755 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 349 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1370 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-03 20:10:28,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1370 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2025-03-03 20:10:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 6939. [2025-03-03 20:10:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6939 states, 5066 states have (on average 1.5842874062376628) internal successors, (8026), 5084 states have internal predecessors, (8026), 1824 states have call successors, (1824), 48 states have call predecessors, (1824), 48 states have return successors, (1824), 1806 states have call predecessors, (1824), 1824 states have call successors, (1824) [2025-03-03 20:10:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 11674 transitions. [2025-03-03 20:10:29,275 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 11674 transitions. Word has length 779 [2025-03-03 20:10:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 6939 states and 11674 transitions. [2025-03-03 20:10:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 11674 transitions. [2025-03-03 20:10:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:29,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:29,291 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:29,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 166040890, now seen corresponding path program 1 times [2025-03-03 20:10:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313226395] [2025-03-03 20:10:29,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:29,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:29,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:29,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313226395] [2025-03-03 20:10:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313226395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:30,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:30,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427541456] [2025-03-03 20:10:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:30,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:30,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:30,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:30,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:30,083 INFO L87 Difference]: Start difference. First operand 6939 states and 11674 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:30,575 INFO L93 Difference]: Finished difference Result 18147 states and 30580 transitions. [2025-03-03 20:10:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:30,648 INFO L225 Difference]: With dead ends: 18147 [2025-03-03 20:10:30,648 INFO L226 Difference]: Without dead ends: 13495 [2025-03-03 20:10:30,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03 20:10:30,665 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 545 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:30,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1142 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13495 states. [2025-03-03 20:10:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13495 to 6951. [2025-03-03 20:10:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6951 states, 5078 states have (on average 1.5840882237101221) internal successors, (8044), 5096 states have internal predecessors, (8044), 1824 states have call successors, (1824), 48 states have call predecessors, (1824), 48 states have return successors, (1824), 1806 states have call predecessors, (1824), 1824 states have call successors, (1824) [2025-03-03 20:10:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6951 states to 6951 states and 11692 transitions. [2025-03-03 20:10:31,350 INFO L78 Accepts]: Start accepts. Automaton has 6951 states and 11692 transitions. Word has length 779 [2025-03-03 20:10:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 6951 states and 11692 transitions. [2025-03-03 20:10:31,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6951 states and 11692 transitions. [2025-03-03 20:10:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:31,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:31,368 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:31,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:31,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 409963865, now seen corresponding path program 1 times [2025-03-03 20:10:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562998908] [2025-03-03 20:10:31,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:31,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:31,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:31,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:31,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562998908] [2025-03-03 20:10:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562998908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:31,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:31,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688140406] [2025-03-03 20:10:31,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:31,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:31,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:31,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:31,919 INFO L87 Difference]: Start difference. First operand 6951 states and 11692 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:32,715 INFO L93 Difference]: Finished difference Result 17216 states and 29185 transitions. [2025-03-03 20:10:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:32,754 INFO L225 Difference]: With dead ends: 17216 [2025-03-03 20:10:32,754 INFO L226 Difference]: Without dead ends: 10268 [2025-03-03 20:10:32,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:32,776 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 516 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:32,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2290 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:10:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-03-03 20:10:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 9882. [2025-03-03 20:10:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9882 states, 7882 states have (on average 1.6461557980208068) internal successors, (12975), 7900 states have internal predecessors, (12975), 1948 states have call successors, (1948), 51 states have call predecessors, (1948), 51 states have return successors, (1948), 1930 states have call predecessors, (1948), 1948 states have call successors, (1948) [2025-03-03 20:10:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9882 states to 9882 states and 16871 transitions. [2025-03-03 20:10:33,266 INFO L78 Accepts]: Start accepts. Automaton has 9882 states and 16871 transitions. Word has length 779 [2025-03-03 20:10:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 9882 states and 16871 transitions. [2025-03-03 20:10:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9882 states and 16871 transitions. [2025-03-03 20:10:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:33,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:33,277 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:33,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:33,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:33,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash 703366872, now seen corresponding path program 1 times [2025-03-03 20:10:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:33,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486705523] [2025-03-03 20:10:33,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:33,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:33,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:33,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486705523] [2025-03-03 20:10:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486705523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:33,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:33,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904148068] [2025-03-03 20:10:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:33,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:33,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:33,849 INFO L87 Difference]: Start difference. First operand 9882 states and 16871 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:35,396 INFO L93 Difference]: Finished difference Result 39096 states and 66838 transitions. [2025-03-03 20:10:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:10:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:35,498 INFO L225 Difference]: With dead ends: 39096 [2025-03-03 20:10:35,498 INFO L226 Difference]: Without dead ends: 32100 [2025-03-03 20:10:35,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:10:35,530 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1246 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:35,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3180 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:10:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32100 states. [2025-03-03 20:10:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32100 to 23898. [2025-03-03 20:10:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23898 states, 21105 states have (on average 1.703387822790808) internal successors, (35950), 21147 states have internal predecessors, (35950), 2692 states have call successors, (2692), 100 states have call predecessors, (2692), 100 states have return successors, (2692), 2650 states have call predecessors, (2692), 2692 states have call successors, (2692) [2025-03-03 20:10:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23898 states to 23898 states and 41334 transitions. [2025-03-03 20:10:36,778 INFO L78 Accepts]: Start accepts. Automaton has 23898 states and 41334 transitions. Word has length 779 [2025-03-03 20:10:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:36,779 INFO L471 AbstractCegarLoop]: Abstraction has 23898 states and 41334 transitions. [2025-03-03 20:10:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23898 states and 41334 transitions. [2025-03-03 20:10:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:36,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:36,802 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:36,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:10:36,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:36,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 72908247, now seen corresponding path program 1 times [2025-03-03 20:10:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309093270] [2025-03-03 20:10:36,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:36,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:36,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:36,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:37,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309093270] [2025-03-03 20:10:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309093270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:37,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335515140] [2025-03-03 20:10:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:37,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:37,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:37,099 INFO L87 Difference]: Start difference. First operand 23898 states and 41334 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:37,771 INFO L93 Difference]: Finished difference Result 38404 states and 65915 transitions. [2025-03-03 20:10:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:37,843 INFO L225 Difference]: With dead ends: 38404 [2025-03-03 20:10:37,843 INFO L226 Difference]: Without dead ends: 18028 [2025-03-03 20:10:37,878 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-03 20:10:37,879 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 346 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:37,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1609 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:10:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2025-03-03 20:10:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 18002. [2025-03-03 20:10:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18002 states, 15136 states have (on average 1.6697278012684988) internal successors, (25273), 15178 states have internal predecessors, (25273), 2740 states have call successors, (2740), 125 states have call predecessors, (2740), 125 states have return successors, (2740), 2698 states have call predecessors, (2740), 2740 states have call successors, (2740) [2025-03-03 20:10:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 30753 transitions. [2025-03-03 20:10:38,693 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 30753 transitions. Word has length 779 [2025-03-03 20:10:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:38,696 INFO L471 AbstractCegarLoop]: Abstraction has 18002 states and 30753 transitions. [2025-03-03 20:10:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 30753 transitions. [2025-03-03 20:10:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:38,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:38,713 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:10:38,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:38,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -505875367, now seen corresponding path program 1 times [2025-03-03 20:10:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:38,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112910277] [2025-03-03 20:10:38,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:38,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:38,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:38,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112910277] [2025-03-03 20:10:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112910277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491927768] [2025-03-03 20:10:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:39,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:39,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:39,083 INFO L87 Difference]: Start difference. First operand 18002 states and 30753 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:39,854 INFO L93 Difference]: Finished difference Result 43040 states and 73247 transitions. [2025-03-03 20:10:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:39,957 INFO L225 Difference]: With dead ends: 43040 [2025-03-03 20:10:39,957 INFO L226 Difference]: Without dead ends: 30604 [2025-03-03 20:10:39,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:39,993 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 189 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:39,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1248 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2025-03-03 20:10:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 28706. [2025-03-03 20:10:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28706 states, 25048 states have (on average 1.6959837112743532) internal successors, (42481), 25114 states have internal predecessors, (42481), 3484 states have call successors, (3484), 173 states have call predecessors, (3484), 173 states have return successors, (3484), 3418 states have call predecessors, (3484), 3484 states have call successors, (3484) [2025-03-03 20:10:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28706 states to 28706 states and 49449 transitions. [2025-03-03 20:10:41,281 INFO L78 Accepts]: Start accepts. Automaton has 28706 states and 49449 transitions. Word has length 779 [2025-03-03 20:10:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:41,283 INFO L471 AbstractCegarLoop]: Abstraction has 28706 states and 49449 transitions. [2025-03-03 20:10:41,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28706 states and 49449 transitions. [2025-03-03 20:10:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:41,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:41,307 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:10:41,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:41,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1136333992, now seen corresponding path program 1 times [2025-03-03 20:10:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891758872] [2025-03-03 20:10:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:41,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:41,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891758872] [2025-03-03 20:10:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891758872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:42,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:42,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520841468] [2025-03-03 20:10:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:42,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:42,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:42,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:42,085 INFO L87 Difference]: Start difference. First operand 28706 states and 49449 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:45,201 INFO L93 Difference]: Finished difference Result 120636 states and 208444 transitions. [2025-03-03 20:10:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:10:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:10:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:45,460 INFO L225 Difference]: With dead ends: 120636 [2025-03-03 20:10:45,461 INFO L226 Difference]: Without dead ends: 93872 [2025-03-03 20:10:45,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:45,524 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1503 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 2211 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:10:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93872 states. [2025-03-03 20:10:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93872 to 83886. [2025-03-03 20:10:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83886 states, 75619 states have (on average 1.7144632962615216) internal successors, (129646), 75793 states have internal predecessors, (129646), 7828 states have call successors, (7828), 438 states have call predecessors, (7828), 438 states have return successors, (7828), 7654 states have call predecessors, (7828), 7828 states have call successors, (7828) [2025-03-03 20:10:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83886 states to 83886 states and 145302 transitions. [2025-03-03 20:10:48,457 INFO L78 Accepts]: Start accepts. Automaton has 83886 states and 145302 transitions. Word has length 779 [2025-03-03 20:10:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:48,458 INFO L471 AbstractCegarLoop]: Abstraction has 83886 states and 145302 transitions. [2025-03-03 20:10:48,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:10:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 83886 states and 145302 transitions. [2025-03-03 20:10:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:10:48,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:48,513 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:10:48,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -785534055, now seen corresponding path program 1 times [2025-03-03 20:10:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841922331] [2025-03-03 20:10:48,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:48,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:10:48,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:10:48,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:48,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:10:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:52,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841922331] [2025-03-03 20:10:52,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841922331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:52,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779606810] [2025-03-03 20:10:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:52,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:52,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:52,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:52,144 INFO L87 Difference]: Start difference. First operand 83886 states and 145302 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:11:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:00,267 INFO L93 Difference]: Finished difference Result 286144 states and 491478 transitions. [2025-03-03 20:11:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:11:00,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-03-03 20:11:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:00,933 INFO L225 Difference]: With dead ends: 286144 [2025-03-03 20:11:00,933 INFO L226 Difference]: Without dead ends: 232978 [2025-03-03 20:11:01,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:01,065 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 2268 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:01,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 3450 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:11:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232978 states. [2025-03-03 20:11:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232978 to 116128. [2025-03-03 20:11:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116128 states, 101901 states have (on average 1.69628364785429) internal successors, (172853), 102207 states have internal predecessors, (172853), 13460 states have call successors, (13460), 766 states have call predecessors, (13460), 766 states have return successors, (13460), 13154 states have call predecessors, (13460), 13460 states have call successors, (13460) [2025-03-03 20:11:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116128 states to 116128 states and 199773 transitions. [2025-03-03 20:11:07,665 INFO L78 Accepts]: Start accepts. Automaton has 116128 states and 199773 transitions. Word has length 779 [2025-03-03 20:11:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 116128 states and 199773 transitions. [2025-03-03 20:11:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-03-03 20:11:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 116128 states and 199773 transitions. [2025-03-03 20:11:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-03-03 20:11:07,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:07,734 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:11:07,734 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash -726837306, now seen corresponding path program 1 times [2025-03-03 20:11:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747554662] [2025-03-03 20:11:07,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-03-03 20:11:07,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-03-03 20:11:07,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:07,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-03-03 20:11:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747554662] [2025-03-03 20:11:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747554662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573537378] [2025-03-03 20:11:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:12,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:12,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:12,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:12,105 INFO L87 Difference]: Start difference. First operand 116128 states and 199773 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 2 states have call predecessors, (124), 2 states have call successors, (124) [2025-03-03 20:11:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:21,030 INFO L93 Difference]: Finished difference Result 245235 states and 418198 transitions. [2025-03-03 20:11:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:11:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 2 states have call predecessors, (124), 2 states have call successors, (124) Word has length 780 [2025-03-03 20:11:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:21,445 INFO L225 Difference]: With dead ends: 245235 [2025-03-03 20:11:21,445 INFO L226 Difference]: Without dead ends: 175348 [2025-03-03 20:11:21,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:21,565 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 1556 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:21,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 1372 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:11:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175348 states.