./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label28.c -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 693604fe74726cb26a5402144f519fff0691b306c00b0b2405a8cfbcd5ac5921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:24:22,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:24:22,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:24:22,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:24:22,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:24:22,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:24:22,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:24:22,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:24:22,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:24:22,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:24:22,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:24:22,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:24:22,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:24:22,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:24:22,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:24:22,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:24:22,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:24:22,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:24:22,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:24:22,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:24:22,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:24:22,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:24:22,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:24:22,205 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 -> 693604fe74726cb26a5402144f519fff0691b306c00b0b2405a8cfbcd5ac5921 [2025-03-16 15:24:22,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:24:22,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:24:22,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:24:22,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:24:22,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:24:22,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label28.c [2025-03-16 15:24:23,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345d57a21/14f1289c1c594b82b327790e81bffb52/FLAGbb100e83e [2025-03-16 15:24:24,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:24:24,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label28.c [2025-03-16 15:24:24,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345d57a21/14f1289c1c594b82b327790e81bffb52/FLAGbb100e83e [2025-03-16 15:24:24,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345d57a21/14f1289c1c594b82b327790e81bffb52 [2025-03-16 15:24:24,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:24:24,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:24:24,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:24:24,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:24:24,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:24:24,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:24,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1ea205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24, skipping insertion in model container [2025-03-16 15:24:24,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:24,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:24:24,289 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/eca-rers2012/Problem18_label28.c[6667,6680] [2025-03-16 15:24:24,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:24:24,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:24:24,732 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/eca-rers2012/Problem18_label28.c[6667,6680] [2025-03-16 15:24:24,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:24:24,895 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:24:24,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24 WrapperNode [2025-03-16 15:24:24,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:24:24,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:24:24,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:24:24,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:24:24,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:24,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,084 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:24:25,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:24:25,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:24:25,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:24:25,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:24:25,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,201 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-16 15:24:25,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:24:25,310 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:24:25,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:24:25,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:24:25,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (1/1) ... [2025-03-16 15:24:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:24:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:25,335 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-16 15:24:25,340 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-16 15:24:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:24:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:24:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:24:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:24:25,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:24:25,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:24:28,100 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:24:28,101 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:24:28,211 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:24:28,211 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:24:28,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:24:28,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:24:28,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:24:28 BoogieIcfgContainer [2025-03-16 15:24:28,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:24:28,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:24:28,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:24:28,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:24:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:24:24" (1/3) ... [2025-03-16 15:24:28,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e9ee47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:24:28, skipping insertion in model container [2025-03-16 15:24:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:24:24" (2/3) ... [2025-03-16 15:24:28,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e9ee47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:24:28, skipping insertion in model container [2025-03-16 15:24:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:24:28" (3/3) ... [2025-03-16 15:24:28,248 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label28.c [2025-03-16 15:24:28,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:24:28,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label28.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:24:28,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:24:28,321 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;@3690c7f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:24:28,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:24:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 15:24:28,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:28,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:28,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2086002444, now seen corresponding path program 1 times [2025-03-16 15:24:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896876528] [2025-03-16 15:24:28,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 15:24:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 15:24:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:24:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896876528] [2025-03-16 15:24:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896876528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:28,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:28,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:24:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437651133] [2025-03-16 15:24:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:24:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:28,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:24:28,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:24:28,484 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:28,550 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:24:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:24:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 15:24:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:28,567 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:24:28,567 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:24:28,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 15:24:28,575 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:28,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:24:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:24:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:24:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:24:28,644 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 63 [2025-03-16 15:24:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:28,644 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:24:28,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:24:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 15:24:28,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:28,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:24:28,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2041467109, now seen corresponding path program 1 times [2025-03-16 15:24:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812536351] [2025-03-16 15:24:28,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:28,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 15:24:28,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 15:24:28,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:28,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:24:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812536351] [2025-03-16 15:24:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812536351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:24:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782721554] [2025-03-16 15:24:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:28,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:28,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:28,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:28,851 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:31,142 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2025-03-16 15:24:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 15:24:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:31,148 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 15:24:31,148 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 15:24:31,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:24:31,149 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 656 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:31,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 249 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:24:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 15:24:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-16 15:24:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.7344428364688858) internal successors, (2397), 1382 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2397 transitions. [2025-03-16 15:24:31,180 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2397 transitions. Word has length 63 [2025-03-16 15:24:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:31,180 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2397 transitions. [2025-03-16 15:24:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2397 transitions. [2025-03-16 15:24:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 15:24:31,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:31,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:31,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:24:31,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:31,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:31,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1601558670, now seen corresponding path program 1 times [2025-03-16 15:24:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:31,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722333495] [2025-03-16 15:24:31,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 15:24:31,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 15:24:31,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:24:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722333495] [2025-03-16 15:24:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722333495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:31,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:31,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:24:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884540724] [2025-03-16 15:24:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:31,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:31,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:31,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:31,361 INFO L87 Difference]: Start difference. First operand 1383 states and 2397 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:33,452 INFO L93 Difference]: Finished difference Result 4145 states and 7188 transitions. [2025-03-16 15:24:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-16 15:24:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:33,461 INFO L225 Difference]: With dead ends: 4145 [2025-03-16 15:24:33,462 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 15:24:33,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:24:33,465 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 676 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:33,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 572 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:24:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 15:24:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-16 15:24:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4308472121650977) internal successors, (3952), 2762 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3952 transitions. [2025-03-16 15:24:33,506 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3952 transitions. Word has length 132 [2025-03-16 15:24:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3952 transitions. [2025-03-16 15:24:33,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3952 transitions. [2025-03-16 15:24:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 15:24:33,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:33,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-16 15:24:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:24:33,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -865573530, now seen corresponding path program 1 times [2025-03-16 15:24:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566526029] [2025-03-16 15:24:33,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:33,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 15:24:33,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 15:24:33,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:33,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:24:33,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:33,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566526029] [2025-03-16 15:24:33,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566526029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:33,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:33,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:24:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507677209] [2025-03-16 15:24:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:33,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:33,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:33,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:33,782 INFO L87 Difference]: Start difference. First operand 2763 states and 3952 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:35,721 INFO L93 Difference]: Finished difference Result 8285 states and 11853 transitions. [2025-03-16 15:24:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 15:24:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:35,736 INFO L225 Difference]: With dead ends: 8285 [2025-03-16 15:24:35,736 INFO L226 Difference]: Without dead ends: 5523 [2025-03-16 15:24:35,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:24:35,740 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 689 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:35,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:24:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2025-03-16 15:24:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5523. [2025-03-16 15:24:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.2817819630568634) internal successors, (7078), 5522 states have internal predecessors, (7078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7078 transitions. [2025-03-16 15:24:35,812 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 7078 transitions. Word has length 148 [2025-03-16 15:24:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:35,812 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 7078 transitions. [2025-03-16 15:24:35,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 7078 transitions. [2025-03-16 15:24:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 15:24:35,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:35,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:35,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:24:35,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash 833757310, now seen corresponding path program 1 times [2025-03-16 15:24:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478578378] [2025-03-16 15:24:35,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:35,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 15:24:35,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 15:24:35,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:35,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 15:24:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478578378] [2025-03-16 15:24:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478578378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:36,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:36,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511668769] [2025-03-16 15:24:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:24:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:36,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:24:36,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:36,249 INFO L87 Difference]: Start difference. First operand 5523 states and 7078 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:39,017 INFO L93 Difference]: Finished difference Result 15185 states and 18703 transitions. [2025-03-16 15:24:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:39,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2025-03-16 15:24:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:39,041 INFO L225 Difference]: With dead ends: 15185 [2025-03-16 15:24:39,041 INFO L226 Difference]: Without dead ends: 9663 [2025-03-16 15:24:39,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 15:24:39,046 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:39,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 646 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:24:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9663 states. [2025-03-16 15:24:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9663 to 8283. [2025-03-16 15:24:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8282 states have (on average 1.215406906544313) internal successors, (10066), 8282 states have internal predecessors, (10066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 10066 transitions. [2025-03-16 15:24:39,181 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 10066 transitions. Word has length 250 [2025-03-16 15:24:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:39,182 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 10066 transitions. [2025-03-16 15:24:39,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 10066 transitions. [2025-03-16 15:24:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 15:24:39,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:39,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:39,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:24:39,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1523625714, now seen corresponding path program 1 times [2025-03-16 15:24:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:39,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998922683] [2025-03-16 15:24:39,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:39,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 15:24:39,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 15:24:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-16 15:24:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998922683] [2025-03-16 15:24:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998922683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856185450] [2025-03-16 15:24:39,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:24:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:39,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:24:39,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:39,726 INFO L87 Difference]: Start difference. First operand 8283 states and 10066 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:41,558 INFO L93 Difference]: Finished difference Result 18688 states and 22308 transitions. [2025-03-16 15:24:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2025-03-16 15:24:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:41,578 INFO L225 Difference]: With dead ends: 18688 [2025-03-16 15:24:41,579 INFO L226 Difference]: Without dead ends: 10353 [2025-03-16 15:24:41,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:41,584 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 513 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:41,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 635 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:24:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10353 states. [2025-03-16 15:24:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10353 to 10353. [2025-03-16 15:24:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10353 states, 10352 states have (on average 1.1352395672333848) internal successors, (11752), 10352 states have internal predecessors, (11752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10353 states to 10353 states and 11752 transitions. [2025-03-16 15:24:41,707 INFO L78 Accepts]: Start accepts. Automaton has 10353 states and 11752 transitions. Word has length 432 [2025-03-16 15:24:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:41,707 INFO L471 AbstractCegarLoop]: Abstraction has 10353 states and 11752 transitions. [2025-03-16 15:24:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10353 states and 11752 transitions. [2025-03-16 15:24:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2025-03-16 15:24:41,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:41,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:41,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:24:41,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:41,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1334068771, now seen corresponding path program 1 times [2025-03-16 15:24:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:41,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547300637] [2025-03-16 15:24:41,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 877 statements into 1 equivalence classes. [2025-03-16 15:24:41,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 877 of 877 statements. [2025-03-16 15:24:41,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:41,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 15:24:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547300637] [2025-03-16 15:24:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547300637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:42,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:42,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:42,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954974024] [2025-03-16 15:24:42,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:42,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:42,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:42,388 INFO L87 Difference]: Start difference. First operand 10353 states and 11752 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:43,998 INFO L93 Difference]: Finished difference Result 24845 states and 28498 transitions. [2025-03-16 15:24:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 877 [2025-03-16 15:24:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:44,019 INFO L225 Difference]: With dead ends: 24845 [2025-03-16 15:24:44,019 INFO L226 Difference]: Without dead ends: 14493 [2025-03-16 15:24:44,027 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-16 15:24:44,028 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 637 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:44,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 318 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:24:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2025-03-16 15:24:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 13803. [2025-03-16 15:24:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13803 states, 13802 states have (on average 1.1514273293725548) internal successors, (15892), 13802 states have internal predecessors, (15892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 15892 transitions. [2025-03-16 15:24:44,156 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 15892 transitions. Word has length 877 [2025-03-16 15:24:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:44,157 INFO L471 AbstractCegarLoop]: Abstraction has 13803 states and 15892 transitions. [2025-03-16 15:24:44,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 15892 transitions. [2025-03-16 15:24:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2025-03-16 15:24:44,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:44,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:44,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:24:44,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1492875410, now seen corresponding path program 1 times [2025-03-16 15:24:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544060733] [2025-03-16 15:24:44,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-16 15:24:44,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-16 15:24:44,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:44,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-16 15:24:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544060733] [2025-03-16 15:24:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544060733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:24:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817120973] [2025-03-16 15:24:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:44,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:44,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:44,922 INFO L87 Difference]: Start difference. First operand 13803 states and 15892 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 2 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:46,617 INFO L93 Difference]: Finished difference Result 34505 states and 40336 transitions. [2025-03-16 15:24:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 2 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 962 [2025-03-16 15:24:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:46,652 INFO L225 Difference]: With dead ends: 34505 [2025-03-16 15:24:46,652 INFO L226 Difference]: Without dead ends: 20703 [2025-03-16 15:24:46,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:24:46,664 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 247 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:46,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 81 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:24:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20703 states. [2025-03-16 15:24:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20703. [2025-03-16 15:24:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20703 states, 20702 states have (on average 1.167761568930538) internal successors, (24175), 20702 states have internal predecessors, (24175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 24175 transitions. [2025-03-16 15:24:46,938 INFO L78 Accepts]: Start accepts. Automaton has 20703 states and 24175 transitions. Word has length 962 [2025-03-16 15:24:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:46,940 INFO L471 AbstractCegarLoop]: Abstraction has 20703 states and 24175 transitions. [2025-03-16 15:24:46,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 2 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 20703 states and 24175 transitions. [2025-03-16 15:24:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-03-16 15:24:46,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:46,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:46,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:24:46,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1756996035, now seen corresponding path program 1 times [2025-03-16 15:24:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15057174] [2025-03-16 15:24:46,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:47,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-03-16 15:24:47,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-03-16 15:24:47,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:47,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-16 15:24:47,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15057174] [2025-03-16 15:24:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15057174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239566791] [2025-03-16 15:24:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:47,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:47,654 INFO L87 Difference]: Start difference. First operand 20703 states and 24175 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:49,232 INFO L93 Difference]: Finished difference Result 40715 states and 47655 transitions. [2025-03-16 15:24:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 963 [2025-03-16 15:24:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:49,257 INFO L225 Difference]: With dead ends: 40715 [2025-03-16 15:24:49,258 INFO L226 Difference]: Without dead ends: 20013 [2025-03-16 15:24:49,270 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-16 15:24:49,271 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 632 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:49,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1089 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:24:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20013 states. [2025-03-16 15:24:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20013 to 20013. [2025-03-16 15:24:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.10893463921647) internal successors, (22192), 20012 states have internal predecessors, (22192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 22192 transitions. [2025-03-16 15:24:49,541 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 22192 transitions. Word has length 963 [2025-03-16 15:24:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:49,543 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 22192 transitions. [2025-03-16 15:24:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 22192 transitions. [2025-03-16 15:24:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2025-03-16 15:24:49,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:49,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:24:49,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash 842131143, now seen corresponding path program 1 times [2025-03-16 15:24:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:49,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576097834] [2025-03-16 15:24:49,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:49,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1016 statements into 1 equivalence classes. [2025-03-16 15:24:49,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1016 of 1016 statements. [2025-03-16 15:24:49,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:49,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-03-16 15:24:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576097834] [2025-03-16 15:24:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576097834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578284049] [2025-03-16 15:24:50,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:50,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:50,591 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-16 15:24:50,594 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-16 15:24:50,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1016 statements into 1 equivalence classes. [2025-03-16 15:24:50,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1016 of 1016 statements. [2025-03-16 15:24:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:50,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:50,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 15:24:51,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578284049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:24:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406292279] [2025-03-16 15:24:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:24:51,702 INFO L87 Difference]: Start difference. First operand 20013 states and 22192 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:53,331 INFO L93 Difference]: Finished difference Result 50375 states and 56467 transitions. [2025-03-16 15:24:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1016 [2025-03-16 15:24:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:53,373 INFO L225 Difference]: With dead ends: 50375 [2025-03-16 15:24:53,374 INFO L226 Difference]: Without dead ends: 30363 [2025-03-16 15:24:53,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:24:53,390 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 183 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:53,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 361 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:24:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30363 states. [2025-03-16 15:24:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 26223. [2025-03-16 15:24:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26223 states, 26222 states have (on average 1.104416139119823) internal successors, (28960), 26222 states have internal predecessors, (28960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26223 states to 26223 states and 28960 transitions. [2025-03-16 15:24:53,678 INFO L78 Accepts]: Start accepts. Automaton has 26223 states and 28960 transitions. Word has length 1016 [2025-03-16 15:24:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:53,678 INFO L471 AbstractCegarLoop]: Abstraction has 26223 states and 28960 transitions. [2025-03-16 15:24:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26223 states and 28960 transitions. [2025-03-16 15:24:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2025-03-16 15:24:53,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:53,686 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:53,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:24:53,886 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,SelfDestructingSolverStorable9 [2025-03-16 15:24:53,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:53,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2107727630, now seen corresponding path program 1 times [2025-03-16 15:24:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:53,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537897974] [2025-03-16 15:24:53,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:53,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1048 statements into 1 equivalence classes. [2025-03-16 15:24:53,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1048 of 1048 statements. [2025-03-16 15:24:53,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:53,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:24:54,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:54,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537897974] [2025-03-16 15:24:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537897974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482083901] [2025-03-16 15:24:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:54,942 INFO L87 Difference]: Start difference. First operand 26223 states and 28960 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:56,370 INFO L93 Difference]: Finished difference Result 52445 states and 57919 transitions. [2025-03-16 15:24:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1048 [2025-03-16 15:24:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:56,424 INFO L225 Difference]: With dead ends: 52445 [2025-03-16 15:24:56,425 INFO L226 Difference]: Without dead ends: 26223 [2025-03-16 15:24:56,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-16 15:24:56,447 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 733 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:56,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 778 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:24:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26223 states. [2025-03-16 15:24:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26223 to 25533. [2025-03-16 15:24:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25533 states, 25532 states have (on average 1.0884380385398715) internal successors, (27790), 25532 states have internal predecessors, (27790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25533 states to 25533 states and 27790 transitions. [2025-03-16 15:24:56,673 INFO L78 Accepts]: Start accepts. Automaton has 25533 states and 27790 transitions. Word has length 1048 [2025-03-16 15:24:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 25533 states and 27790 transitions. [2025-03-16 15:24:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 25533 states and 27790 transitions. [2025-03-16 15:24:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2025-03-16 15:24:56,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:56,681 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:56,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:24:56,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1265017106, now seen corresponding path program 1 times [2025-03-16 15:24:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:56,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978333729] [2025-03-16 15:24:56,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-16 15:24:56,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-16 15:24:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-03-16 15:24:57,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978333729] [2025-03-16 15:24:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978333729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892679659] [2025-03-16 15:24:57,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:57,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:57,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:57,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:57,502 INFO L87 Difference]: Start difference. First operand 25533 states and 27790 transitions. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:59,092 INFO L93 Difference]: Finished difference Result 52445 states and 56982 transitions. [2025-03-16 15:24:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1079 [2025-03-16 15:24:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:59,122 INFO L225 Difference]: With dead ends: 52445 [2025-03-16 15:24:59,122 INFO L226 Difference]: Without dead ends: 26913 [2025-03-16 15:24:59,143 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-16 15:24:59,143 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 575 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:59,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 979 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:24:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2025-03-16 15:24:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 26913. [2025-03-16 15:24:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26913 states, 26912 states have (on average 1.0698944708680143) internal successors, (28793), 26912 states have internal predecessors, (28793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26913 states to 26913 states and 28793 transitions. [2025-03-16 15:24:59,436 INFO L78 Accepts]: Start accepts. Automaton has 26913 states and 28793 transitions. Word has length 1079 [2025-03-16 15:24:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 26913 states and 28793 transitions. [2025-03-16 15:24:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26913 states and 28793 transitions. [2025-03-16 15:24:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1133 [2025-03-16 15:24:59,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:59,446 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:24:59,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:24:59,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:59,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2136339533, now seen corresponding path program 1 times [2025-03-16 15:24:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491063407] [2025-03-16 15:24:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:59,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1132 statements into 1 equivalence classes. [2025-03-16 15:24:59,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1132 of 1132 statements. [2025-03-16 15:24:59,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:59,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:24:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491063407] [2025-03-16 15:24:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491063407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216690815] [2025-03-16 15:24:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:59,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:59,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:59,855 INFO L87 Difference]: Start difference. First operand 26913 states and 28793 transitions. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:01,320 INFO L93 Difference]: Finished difference Result 60725 states and 65776 transitions. [2025-03-16 15:25:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1132 [2025-03-16 15:25:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:01,357 INFO L225 Difference]: With dead ends: 60725 [2025-03-16 15:25:01,357 INFO L226 Difference]: Without dead ends: 33813 [2025-03-16 15:25:01,375 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-16 15:25:01,376 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:01,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 930 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33813 states. [2025-03-16 15:25:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33813 to 33813. [2025-03-16 15:25:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33813 states, 33812 states have (on average 1.07609724358216) internal successors, (36385), 33812 states have internal predecessors, (36385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33813 states to 33813 states and 36385 transitions. [2025-03-16 15:25:01,651 INFO L78 Accepts]: Start accepts. Automaton has 33813 states and 36385 transitions. Word has length 1132 [2025-03-16 15:25:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:01,652 INFO L471 AbstractCegarLoop]: Abstraction has 33813 states and 36385 transitions. [2025-03-16 15:25:01,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33813 states and 36385 transitions. [2025-03-16 15:25:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1139 [2025-03-16 15:25:01,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:01,661 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:01,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:25:01,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:01,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1049465180, now seen corresponding path program 1 times [2025-03-16 15:25:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643855008] [2025-03-16 15:25:01,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-03-16 15:25:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-03-16 15:25:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:25:02,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643855008] [2025-03-16 15:25:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643855008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:02,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:02,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347335461] [2025-03-16 15:25:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:02,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:02,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:02,140 INFO L87 Difference]: Start difference. First operand 33813 states and 36385 transitions. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:03,650 INFO L93 Difference]: Finished difference Result 77285 states and 83995 transitions. [2025-03-16 15:25:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1138 [2025-03-16 15:25:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:03,692 INFO L225 Difference]: With dead ends: 77285 [2025-03-16 15:25:03,693 INFO L226 Difference]: Without dead ends: 41403 [2025-03-16 15:25:03,714 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-16 15:25:03,714 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 604 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:03,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1118 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41403 states. [2025-03-16 15:25:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41403 to 41403. [2025-03-16 15:25:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41403 states, 41402 states have (on average 1.069489396647505) internal successors, (44279), 41402 states have internal predecessors, (44279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41403 states to 41403 states and 44279 transitions. [2025-03-16 15:25:04,213 INFO L78 Accepts]: Start accepts. Automaton has 41403 states and 44279 transitions. Word has length 1138 [2025-03-16 15:25:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:04,213 INFO L471 AbstractCegarLoop]: Abstraction has 41403 states and 44279 transitions. [2025-03-16 15:25:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 41403 states and 44279 transitions. [2025-03-16 15:25:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2025-03-16 15:25:04,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:04,231 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:25:04,231 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1217466103, now seen corresponding path program 1 times [2025-03-16 15:25:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274052403] [2025-03-16 15:25:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1156 statements into 1 equivalence classes. [2025-03-16 15:25:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1156 of 1156 statements. [2025-03-16 15:25:04,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-03-16 15:25:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274052403] [2025-03-16 15:25:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274052403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829708031] [2025-03-16 15:25:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:04,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:04,785 INFO L87 Difference]: Start difference. First operand 41403 states and 44279 transitions. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:06,357 INFO L93 Difference]: Finished difference Result 92465 states and 99769 transitions. [2025-03-16 15:25:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:06,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1156 [2025-03-16 15:25:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:06,400 INFO L225 Difference]: With dead ends: 92465 [2025-03-16 15:25:06,401 INFO L226 Difference]: Without dead ends: 47613 [2025-03-16 15:25:06,418 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-16 15:25:06,419 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 650 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:06,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1061 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:25:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47613 states. [2025-03-16 15:25:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47613 to 46233. [2025-03-16 15:25:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46233 states, 46232 states have (on average 1.0417676068523967) internal successors, (48163), 46232 states have internal predecessors, (48163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46233 states to 46233 states and 48163 transitions. [2025-03-16 15:25:06,755 INFO L78 Accepts]: Start accepts. Automaton has 46233 states and 48163 transitions. Word has length 1156 [2025-03-16 15:25:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 46233 states and 48163 transitions. [2025-03-16 15:25:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 46233 states and 48163 transitions. [2025-03-16 15:25:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2025-03-16 15:25:06,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:06,772 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:06,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:25:06,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:06,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2087199903, now seen corresponding path program 1 times [2025-03-16 15:25:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:06,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663792486] [2025-03-16 15:25:06,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:06,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1371 statements into 1 equivalence classes. [2025-03-16 15:25:06,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1371 of 1371 statements. [2025-03-16 15:25:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-16 15:25:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663792486] [2025-03-16 15:25:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663792486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282801733] [2025-03-16 15:25:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:07,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:07,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:07,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:07,370 INFO L87 Difference]: Start difference. First operand 46233 states and 48163 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:08,811 INFO L93 Difference]: Finished difference Result 102125 states and 106722 transitions. [2025-03-16 15:25:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:08,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1371 [2025-03-16 15:25:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:08,867 INFO L225 Difference]: With dead ends: 102125 [2025-03-16 15:25:08,867 INFO L226 Difference]: Without dead ends: 56583 [2025-03-16 15:25:08,894 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-16 15:25:08,895 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 456 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 964 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:25:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56583 states. [2025-03-16 15:25:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56583 to 55893. [2025-03-16 15:25:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55893 states, 55892 states have (on average 1.0389680097330567) internal successors, (58070), 55892 states have internal predecessors, (58070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55893 states to 55893 states and 58070 transitions. [2025-03-16 15:25:09,412 INFO L78 Accepts]: Start accepts. Automaton has 55893 states and 58070 transitions. Word has length 1371 [2025-03-16 15:25:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:09,412 INFO L471 AbstractCegarLoop]: Abstraction has 55893 states and 58070 transitions. [2025-03-16 15:25:09,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 55893 states and 58070 transitions. [2025-03-16 15:25:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2025-03-16 15:25:09,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:09,432 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:09,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:25:09,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:09,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2031685127, now seen corresponding path program 1 times [2025-03-16 15:25:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092939156] [2025-03-16 15:25:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:09,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1400 statements into 1 equivalence classes. [2025-03-16 15:25:09,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1400 of 1400 statements. [2025-03-16 15:25:09,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:09,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1534 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-03-16 15:25:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092939156] [2025-03-16 15:25:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092939156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099746578] [2025-03-16 15:25:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:25:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:25:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:25:10,524 INFO L87 Difference]: Start difference. First operand 55893 states and 58070 transitions. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:12,571 INFO L93 Difference]: Finished difference Result 117305 states and 122095 transitions. [2025-03-16 15:25:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:25:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1400 [2025-03-16 15:25:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:12,638 INFO L225 Difference]: With dead ends: 117305 [2025-03-16 15:25:12,638 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:25:12,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:25:12,673 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 803 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:12,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 68 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:25:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:25:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 61413. [2025-03-16 15:25:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61413 states, 61412 states have (on average 1.0391942942747345) internal successors, (63819), 61412 states have internal predecessors, (63819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 63819 transitions. [2025-03-16 15:25:13,270 INFO L78 Accepts]: Start accepts. Automaton has 61413 states and 63819 transitions. Word has length 1400 [2025-03-16 15:25:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 61413 states and 63819 transitions. [2025-03-16 15:25:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 61413 states and 63819 transitions. [2025-03-16 15:25:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2025-03-16 15:25:13,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:13,292 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:25:13,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1536703370, now seen corresponding path program 1 times [2025-03-16 15:25:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327317767] [2025-03-16 15:25:13,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:13,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1479 statements into 1 equivalence classes. [2025-03-16 15:25:13,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1479 of 1479 statements. [2025-03-16 15:25:13,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:13,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2893 backedges. 936 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-16 15:25:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327317767] [2025-03-16 15:25:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327317767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:15,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570316260] [2025-03-16 15:25:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:15,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:15,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:15,792 INFO L87 Difference]: Start difference. First operand 61413 states and 63819 transitions. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:17,132 INFO L93 Difference]: Finished difference Result 123515 states and 128347 transitions. [2025-03-16 15:25:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1479 [2025-03-16 15:25:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:17,192 INFO L225 Difference]: With dead ends: 123515 [2025-03-16 15:25:17,192 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:25:17,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-16 15:25:17,228 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 645 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:17,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 760 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:25:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:25:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 61413. [2025-03-16 15:25:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61413 states, 61412 states have (on average 1.0356933498339087) internal successors, (63604), 61412 states have internal predecessors, (63604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 63604 transitions. [2025-03-16 15:25:17,885 INFO L78 Accepts]: Start accepts. Automaton has 61413 states and 63604 transitions. Word has length 1479 [2025-03-16 15:25:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:17,886 INFO L471 AbstractCegarLoop]: Abstraction has 61413 states and 63604 transitions. [2025-03-16 15:25:17,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61413 states and 63604 transitions. [2025-03-16 15:25:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1521 [2025-03-16 15:25:17,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:17,927 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:17,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:25:17,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1817236910, now seen corresponding path program 1 times [2025-03-16 15:25:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212417548] [2025-03-16 15:25:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1520 statements into 1 equivalence classes. [2025-03-16 15:25:18,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1520 of 1520 statements. [2025-03-16 15:25:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2025-03-16 15:25:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212417548] [2025-03-16 15:25:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212417548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495915286] [2025-03-16 15:25:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:18,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:18,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:18,885 INFO L87 Difference]: Start difference. First operand 61413 states and 63604 transitions. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:20,257 INFO L93 Difference]: Finished difference Result 120065 states and 124402 transitions. [2025-03-16 15:25:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1520 [2025-03-16 15:25:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:20,309 INFO L225 Difference]: With dead ends: 120065 [2025-03-16 15:25:20,309 INFO L226 Difference]: Without dead ends: 59343 [2025-03-16 15:25:20,343 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-16 15:25:20,344 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 425 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:20,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 886 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:25:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59343 states. [2025-03-16 15:25:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59343 to 57273. [2025-03-16 15:25:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57273 states, 57272 states have (on average 1.0255622293616427) internal successors, (58736), 57272 states have internal predecessors, (58736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57273 states to 57273 states and 58736 transitions. [2025-03-16 15:25:20,766 INFO L78 Accepts]: Start accepts. Automaton has 57273 states and 58736 transitions. Word has length 1520 [2025-03-16 15:25:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:20,767 INFO L471 AbstractCegarLoop]: Abstraction has 57273 states and 58736 transitions. [2025-03-16 15:25:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 57273 states and 58736 transitions. [2025-03-16 15:25:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1534 [2025-03-16 15:25:20,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:20,789 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:25:20,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:20,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2194113, now seen corresponding path program 1 times [2025-03-16 15:25:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931933267] [2025-03-16 15:25:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:20,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1533 statements into 1 equivalence classes. [2025-03-16 15:25:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1533 of 1533 statements. [2025-03-16 15:25:20,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:20,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 1804 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2025-03-16 15:25:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:21,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931933267] [2025-03-16 15:25:21,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931933267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:21,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:21,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:21,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547412379] [2025-03-16 15:25:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:21,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:21,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:21,562 INFO L87 Difference]: Start difference. First operand 57273 states and 58736 transitions. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:22,980 INFO L93 Difference]: Finished difference Result 115925 states and 118870 transitions. [2025-03-16 15:25:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1533 [2025-03-16 15:25:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:23,033 INFO L225 Difference]: With dead ends: 115925 [2025-03-16 15:25:23,034 INFO L226 Difference]: Without dead ends: 57963 [2025-03-16 15:25:23,187 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-16 15:25:23,188 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:23,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 943 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:25:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57963 states. [2025-03-16 15:25:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57963 to 56583. [2025-03-16 15:25:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56583 states, 56582 states have (on average 1.0207133010498037) internal successors, (57754), 56582 states have internal predecessors, (57754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56583 states to 56583 states and 57754 transitions. [2025-03-16 15:25:23,559 INFO L78 Accepts]: Start accepts. Automaton has 56583 states and 57754 transitions. Word has length 1533 [2025-03-16 15:25:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 56583 states and 57754 transitions. [2025-03-16 15:25:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56583 states and 57754 transitions. [2025-03-16 15:25:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1604 [2025-03-16 15:25:23,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:23,583 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:23,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:25:23,583 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1729633584, now seen corresponding path program 1 times [2025-03-16 15:25:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:23,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116512344] [2025-03-16 15:25:23,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:23,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1603 statements into 1 equivalence classes. [2025-03-16 15:25:23,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1603 of 1603 statements. [2025-03-16 15:25:23,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:23,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 2372 proven. 0 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2025-03-16 15:25:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116512344] [2025-03-16 15:25:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116512344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927990751] [2025-03-16 15:25:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:24,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:24,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:24,188 INFO L87 Difference]: Start difference. First operand 56583 states and 57754 transitions. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:25,829 INFO L93 Difference]: Finished difference Result 138003 states and 141004 transitions. [2025-03-16 15:25:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1603 [2025-03-16 15:25:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:25,831 INFO L225 Difference]: With dead ends: 138003 [2025-03-16 15:25:25,831 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:25:25,874 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-16 15:25:25,875 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 541 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:25,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 898 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:25:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:25:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:25:25,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1603 [2025-03-16 15:25:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:25:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:25:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:25:25,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:25:25,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:25:25,881 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:25:25,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:25:27,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:25:27,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:25:27 BoogieIcfgContainer [2025-03-16 15:25:27,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:25:27,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:25:27,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:25:27,563 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:25:27,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:24:28" (3/4) ... [2025-03-16 15:25:27,568 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:25:27,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 15:25:27,605 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:25:27,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:25:27,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:25:27,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:25:27,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:25:27,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:25:27,784 INFO L158 Benchmark]: Toolchain (without parser) took 63738.31ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 103.7MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-16 15:25:27,785 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:25:27,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.31ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 58.0MB in the end (delta: 45.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-03-16 15:25:27,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.15ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 71.4MB in the end (delta: -13.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-03-16 15:25:27,786 INFO L158 Benchmark]: Boogie Preprocessor took 224.25ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 54.8MB in the end (delta: 16.7MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-03-16 15:25:27,786 INFO L158 Benchmark]: IcfgBuilder took 2926.43ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 54.8MB in the beginning and 167.7MB in the end (delta: -113.0MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2025-03-16 15:25:27,786 INFO L158 Benchmark]: TraceAbstraction took 59319.69ms. Allocated memory was 276.8MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 167.7MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-16 15:25:27,786 INFO L158 Benchmark]: Witness Printer took 220.66ms. Allocated memory is still 4.4GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:25:27,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.31ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 58.0MB in the end (delta: 45.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 188.15ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 71.4MB in the end (delta: -13.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 224.25ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 54.8MB in the end (delta: 16.7MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2926.43ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 54.8MB in the beginning and 167.7MB in the end (delta: -113.0MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59319.69ms. Allocated memory was 276.8MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 167.7MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 220.66ms. Allocated memory is still 4.4GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 211]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.6s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12807 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12807 mSDsluCounter, 15090 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 7851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41370 IncrementalHoareTripleChecker+Invalid, 49221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7851 mSolverCounterUnsat, 14954 mSDtfsCounter, 41370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 1060 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61413occurred in iteration=17, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 13800 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 20381 NumberOfCodeBlocks, 20381 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 20359 ConstructedInterpolants, 0 QuantifiedInterpolants, 36077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1155 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 27365/27374 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((5 == a15) && (a18 == 11)) && (a24 <= 3)) || (((a15 <= 4) && (a24 <= 3)) && (a18 <= 9))) || (((5 == a15) && (a24 <= 3)) && (a18 == 12))) || ((a24 == 0) && (a15 <= 4))) || ((((5 == a15) && (a18 == 10)) && (a24 <= 3)) && (a24 != 3))) || ((((a18 == 11) && (a24 <= 3)) && (a15 == 6)) && (a24 != 3))) || (((a15 <= 4) && (a18 == 10)) && (a24 <= 3))) || (((a24 == 0) && (a15 == 6)) && (a3 <= 99))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || (((5 == a15) && (a18 == 11)) && (a24 == 4))) || ((((5 == a15) && (a18 == 12)) && (a24 == 4)) && (a3 <= 99))) || (((a15 <= 4) && (a18 == 11)) && (a24 <= 3))) || (((a18 == 10) && (a24 <= 3)) && (a15 == 6))) || (((5 == a15) && (a24 <= 3)) && (a18 <= 9))) || (((a24 == 3) && (a15 <= 4)) && (a18 == 12))) || (((a15 <= 4) && (a18 == 10)) && (a24 == 4))) || (((a24 == 1) && (307 <= a3)) && (a15 <= 4))) || (((a15 <= 4) && (a18 == 12)) && (a24 == 4))) || (((a15 <= 4) && (a18 == 11)) && (a24 == 4))) || ((((5 == a15) && (307 <= a3)) && (a24 == 4)) && (a18 <= 9))) || ((((a24 == 3) && (307 <= a3)) && (a18 == 11)) && (a15 == 6))) || (((a15 <= 4) && (a24 == 4)) && (a18 <= 9))) || ((((a24 == 3) && (5 == a15)) && (307 <= a3)) && (a18 == 10))) || (((a24 == 1) && (a15 == 6)) && (a3 <= 99))) || (((a24 <= 3) && (a18 <= 9)) && (a15 == 6))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:25:27,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE