./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label13.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_label13.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 500cc813abfe0151efa486f19e8a796fe317b3befa4ff1a71e777a6dc54703b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:22:58,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:22:58,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:22:58,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:22:58,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:22:58,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:22:58,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:22:58,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:22:58,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:22:58,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:22:58,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:22:58,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:22:58,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:22:58,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:22:58,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:22:58,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:22:58,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:22:58,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:22:58,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:22:58,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:22:58,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:22:58,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:22:58,344 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 -> 500cc813abfe0151efa486f19e8a796fe317b3befa4ff1a71e777a6dc54703b9 [2025-03-16 15:22:58,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:22:58,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:22:58,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:22:58,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:22:58,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:22:58,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label13.c [2025-03-16 15:22:59,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e039e017e/2f9c9c8ee9074d10beae9d490e4a2436/FLAG6b16f841c [2025-03-16 15:23:00,098 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:23:00,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label13.c [2025-03-16 15:23:00,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e039e017e/2f9c9c8ee9074d10beae9d490e4a2436/FLAG6b16f841c [2025-03-16 15:23:00,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e039e017e/2f9c9c8ee9074d10beae9d490e4a2436 [2025-03-16 15:23:00,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:23:00,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:23:00,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:00,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:23:00,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:23:00,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:00" (1/1) ... [2025-03-16 15:23:00,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8cc25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:00, skipping insertion in model container [2025-03-16 15:23:00,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:00" (1/1) ... [2025-03-16 15:23:00,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:23:00,554 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_label13.c[4848,4861] [2025-03-16 15:23:00,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:00,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:23:00,992 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_label13.c[4848,4861] [2025-03-16 15:23:01,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:01,186 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:23:01,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01 WrapperNode [2025-03-16 15:23:01,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:01,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:01,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:23:01,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:23:01,193 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:23:01" (1/1) ... [2025-03-16 15:23:01,226 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:23:01" (1/1) ... [2025-03-16 15:23:01,358 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:23:01,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:01,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:23:01,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:23:01,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:23:01,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,483 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:23:01,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:23:01,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:23:01,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:23:01,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:23:01,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (1/1) ... [2025-03-16 15:23:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:01,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:01,622 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:23:01,629 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:23:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:23:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:23:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:23:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:23:01,725 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:23:01,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:23:04,372 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:23:04,373 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:23:04,492 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:23:04,493 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:23:04,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:23:04,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:23:04,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:04 BoogieIcfgContainer [2025-03-16 15:23:04,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:23:04,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:23:04,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:23:04,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:23:04,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:23:00" (1/3) ... [2025-03-16 15:23:04,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da36144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:04, skipping insertion in model container [2025-03-16 15:23:04,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:01" (2/3) ... [2025-03-16 15:23:04,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da36144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:04, skipping insertion in model container [2025-03-16 15:23:04,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:04" (3/3) ... [2025-03-16 15:23:04,529 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label13.c [2025-03-16 15:23:04,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:23:04,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label13.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:23:04,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:23:04,598 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;@5053b361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:23:04,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:23:04,604 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:23:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:23:04,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:04,608 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] [2025-03-16 15:23:04,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1996721075, now seen corresponding path program 1 times [2025-03-16 15:23:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896565033] [2025-03-16 15:23:04,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:23:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:23:04,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:04,720 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:23:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896565033] [2025-03-16 15:23:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896565033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:04,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46557829] [2025-03-16 15:23:04,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:23:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:04,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:23:04,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:23:04,741 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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:23:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:04,795 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:23:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:23:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2025-03-16 15:23:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:04,812 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:23:04,812 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:23:04,818 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:23:04,820 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:23:04,820 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:23:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:23:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:23:04,878 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:23:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:23:04,889 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 44 [2025-03-16 15:23:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:04,890 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:23:04,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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:23:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:23:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:23:04,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:04,891 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] [2025-03-16 15:23:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:23:04,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:04,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -688291373, now seen corresponding path program 1 times [2025-03-16 15:23:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891462943] [2025-03-16 15:23:04,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:04,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:23:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:23:04,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:04,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:05,068 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:23:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891462943] [2025-03-16 15:23:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891462943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:05,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225803595] [2025-03-16 15:23:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:05,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:05,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:05,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:05,071 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:23:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:07,366 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2025-03-16 15:23:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2025-03-16 15:23:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:07,371 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 15:23:07,371 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 15:23:07,373 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:23:07,374 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 731 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:07,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:23:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 15:23:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-16 15:23:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 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:23:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions. [2025-03-16 15:23:07,441 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 44 [2025-03-16 15:23:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:07,441 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions. [2025-03-16 15:23:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:23:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions. [2025-03-16 15:23:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 15:23:07,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:07,444 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, 1, 1, 1, 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:23:07,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:23:07,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1342346818, now seen corresponding path program 1 times [2025-03-16 15:23:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710088690] [2025-03-16 15:23:07,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:07,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 15:23:07,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 15:23:07,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:07,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710088690] [2025-03-16 15:23:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710088690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:07,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855670709] [2025-03-16 15:23:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:07,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:07,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:07,619 INFO L87 Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:23:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:09,665 INFO L93 Difference]: Finished difference Result 4145 states and 6630 transitions. [2025-03-16 15:23:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2025-03-16 15:23:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:09,674 INFO L225 Difference]: With dead ends: 4145 [2025-03-16 15:23:09,674 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 15:23:09,676 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:23:09,677 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:09,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 528 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:23:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 15:23:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-16 15:23:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 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:23:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions. [2025-03-16 15:23:09,717 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 109 [2025-03-16 15:23:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions. [2025-03-16 15:23:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:23:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions. [2025-03-16 15:23:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 15:23:09,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:09,723 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, 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] [2025-03-16 15:23:09,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:23:09,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -723578668, now seen corresponding path program 1 times [2025-03-16 15:23:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229242196] [2025-03-16 15:23:09,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:09,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 15:23:09,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 15:23:09,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:23:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229242196] [2025-03-16 15:23:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229242196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504866574] [2025-03-16 15:23:10,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:10,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:10,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:10,338 INFO L87 Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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:23:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:13,034 INFO L93 Difference]: Finished difference Result 7595 states and 9793 transitions. [2025-03-16 15:23:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 227 [2025-03-16 15:23:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:13,048 INFO L225 Difference]: With dead ends: 7595 [2025-03-16 15:23:13,049 INFO L226 Difference]: Without dead ends: 4833 [2025-03-16 15:23:13,051 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:23:13,052 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:13,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 640 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:23:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-03-16 15:23:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4143. [2025-03-16 15:23:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.269917914051183) internal successors, (5260), 4142 states have internal predecessors, (5260), 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:23:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5260 transitions. [2025-03-16 15:23:13,106 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5260 transitions. Word has length 227 [2025-03-16 15:23:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5260 transitions. [2025-03-16 15:23:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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:23:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5260 transitions. [2025-03-16 15:23:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-16 15:23:13,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:13,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:23:13,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:13,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1121388063, now seen corresponding path program 1 times [2025-03-16 15:23:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866094707] [2025-03-16 15:23:13,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 15:23:13,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 15:23:13,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:13,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866094707] [2025-03-16 15:23:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866094707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:13,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185476722] [2025-03-16 15:23:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:13,477 INFO L87 Difference]: Start difference. First operand 4143 states and 5260 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:23:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:15,302 INFO L93 Difference]: Finished difference Result 12425 states and 15777 transitions. [2025-03-16 15:23:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 343 [2025-03-16 15:23:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:15,319 INFO L225 Difference]: With dead ends: 12425 [2025-03-16 15:23:15,320 INFO L226 Difference]: Without dead ends: 8283 [2025-03-16 15:23:15,324 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:23:15,325 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 677 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 147 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:23:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-03-16 15:23:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 7593. [2025-03-16 15:23:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7592 states have (on average 1.2642255005268703) internal successors, (9598), 7592 states have internal predecessors, (9598), 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:23:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9598 transitions. [2025-03-16 15:23:15,445 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9598 transitions. Word has length 343 [2025-03-16 15:23:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:15,448 INFO L471 AbstractCegarLoop]: Abstraction has 7593 states and 9598 transitions. [2025-03-16 15:23:15,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:23:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9598 transitions. [2025-03-16 15:23:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-16 15:23:15,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:15,457 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:15,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:23:15,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 615705384, now seen corresponding path program 1 times [2025-03-16 15:23:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2813943] [2025-03-16 15:23:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-16 15:23:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-16 15:23:15,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:15,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:23:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:15,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2813943] [2025-03-16 15:23:15,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2813943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:15,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:15,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491070859] [2025-03-16 15:23:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:15,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:15,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:15,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:15,742 INFO L87 Difference]: Start difference. First operand 7593 states and 9598 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 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:23:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:17,781 INFO L93 Difference]: Finished difference Result 20705 states and 26457 transitions. [2025-03-16 15:23:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 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 428 [2025-03-16 15:23:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:17,810 INFO L225 Difference]: With dead ends: 20705 [2025-03-16 15:23:17,810 INFO L226 Difference]: Without dead ends: 13113 [2025-03-16 15:23:17,815 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:23:17,816 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 497 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 1073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1073 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:17,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 115 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1073 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:23:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13113 states. [2025-03-16 15:23:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13113 to 12423. [2025-03-16 15:23:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 1.275156979552407) internal successors, (15840), 12422 states have internal predecessors, (15840), 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:23:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 15840 transitions. [2025-03-16 15:23:17,963 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 15840 transitions. Word has length 428 [2025-03-16 15:23:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:17,964 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 15840 transitions. [2025-03-16 15:23:17,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 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:23:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 15840 transitions. [2025-03-16 15:23:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-16 15:23:17,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:17,973 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:23:17,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:17,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1621144067, now seen corresponding path program 1 times [2025-03-16 15:23:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398531280] [2025-03-16 15:23:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:17,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-16 15:23:18,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-16 15:23:18,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:18,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-16 15:23:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398531280] [2025-03-16 15:23:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398531280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:18,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:18,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625840379] [2025-03-16 15:23:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:18,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:18,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:18,257 INFO L87 Difference]: Start difference. First operand 12423 states and 15840 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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:23:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:20,039 INFO L93 Difference]: Finished difference Result 24845 states and 31679 transitions. [2025-03-16 15:23:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 429 [2025-03-16 15:23:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:20,060 INFO L225 Difference]: With dead ends: 24845 [2025-03-16 15:23:20,060 INFO L226 Difference]: Without dead ends: 12423 [2025-03-16 15:23:20,070 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:23:20,071 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 651 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:20,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1232 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12423 states. [2025-03-16 15:23:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12423 to 12423. [2025-03-16 15:23:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 1.167766865239092) internal successors, (14506), 12422 states have internal predecessors, (14506), 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:23:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 14506 transitions. [2025-03-16 15:23:20,205 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 14506 transitions. Word has length 429 [2025-03-16 15:23:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:20,205 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 14506 transitions. [2025-03-16 15:23:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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:23:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 14506 transitions. [2025-03-16 15:23:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-16 15:23:20,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:20,213 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:20,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:23:20,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 584500719, now seen corresponding path program 1 times [2025-03-16 15:23:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:20,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768689465] [2025-03-16 15:23:20,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:20,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-16 15:23:20,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-16 15:23:20,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:20,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-16 15:23:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768689465] [2025-03-16 15:23:20,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768689465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25704518] [2025-03-16 15:23:20,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:20,599 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:23:20,600 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:23:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-16 15:23:20,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-16 15:23:20,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:20,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:20,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:23:20,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-16 15:23:21,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25704518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:21,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:21,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:23:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12386708] [2025-03-16 15:23:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:21,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:21,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:21,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:21,265 INFO L87 Difference]: Start difference. First operand 12423 states and 14506 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 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:23:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:22,975 INFO L93 Difference]: Finished difference Result 31745 states and 37587 transitions. [2025-03-16 15:23:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 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 482 [2025-03-16 15:23:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:23,001 INFO L225 Difference]: With dead ends: 31745 [2025-03-16 15:23:23,001 INFO L226 Difference]: Without dead ends: 19323 [2025-03-16 15:23:23,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 481 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:23:23,013 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 400 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:23,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 495 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:23:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19323 states. [2025-03-16 15:23:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19323 to 17253. [2025-03-16 15:23:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17253 states, 17252 states have (on average 1.1538372362624623) internal successors, (19906), 17252 states have internal predecessors, (19906), 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:23:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 19906 transitions. [2025-03-16 15:23:23,211 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 19906 transitions. Word has length 482 [2025-03-16 15:23:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 17253 states and 19906 transitions. [2025-03-16 15:23:23,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 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:23:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 19906 transitions. [2025-03-16 15:23:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 15:23:23,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:23,219 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:23,226 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:23:23,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:23,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1710016314, now seen corresponding path program 1 times [2025-03-16 15:23:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853780853] [2025-03-16 15:23:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:23,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 15:23:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 15:23:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-16 15:23:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853780853] [2025-03-16 15:23:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853780853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766187651] [2025-03-16 15:23:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:23,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:23,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:23,730 INFO L87 Difference]: Start difference. First operand 17253 states and 19906 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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:23:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:25,518 INFO L93 Difference]: Finished difference Result 35938 states and 41274 transitions. [2025-03-16 15:23:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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 483 [2025-03-16 15:23:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:25,541 INFO L225 Difference]: With dead ends: 35938 [2025-03-16 15:23:25,541 INFO L226 Difference]: Without dead ends: 18633 [2025-03-16 15:23:25,554 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:23:25,554 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 638 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.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:25,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 638 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18633 states. [2025-03-16 15:23:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18633 to 18633. [2025-03-16 15:23:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.1132460283383427) internal successors, (20742), 18632 states have internal predecessors, (20742), 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:23:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 20742 transitions. [2025-03-16 15:23:25,743 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 20742 transitions. Word has length 483 [2025-03-16 15:23:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 20742 transitions. [2025-03-16 15:23:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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:23:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 20742 transitions. [2025-03-16 15:23:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-16 15:23:25,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:25,747 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:23:25,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:25,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash -931345910, now seen corresponding path program 1 times [2025-03-16 15:23:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491475497] [2025-03-16 15:23:25,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:25,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-16 15:23:25,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-16 15:23:25,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:25,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-16 15:23:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491475497] [2025-03-16 15:23:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491475497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:25,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446157980] [2025-03-16 15:23:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:25,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:25,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:25,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:25,954 INFO L87 Difference]: Start difference. First operand 18633 states and 20742 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:23:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:27,560 INFO L93 Difference]: Finished difference Result 37265 states and 41483 transitions. [2025-03-16 15:23:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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 514 [2025-03-16 15:23:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:27,577 INFO L225 Difference]: With dead ends: 37265 [2025-03-16 15:23:27,577 INFO L226 Difference]: Without dead ends: 18633 [2025-03-16 15:23:27,589 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:23:27,589 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 752 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 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.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:27,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 778 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18633 states. [2025-03-16 15:23:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18633 to 17943. [2025-03-16 15:23:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17943 states, 17942 states have (on average 1.0965890090290937) internal successors, (19675), 17942 states have internal predecessors, (19675), 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:23:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17943 states to 17943 states and 19675 transitions. [2025-03-16 15:23:27,785 INFO L78 Accepts]: Start accepts. Automaton has 17943 states and 19675 transitions. Word has length 514 [2025-03-16 15:23:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:27,786 INFO L471 AbstractCegarLoop]: Abstraction has 17943 states and 19675 transitions. [2025-03-16 15:23:27,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:23:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 17943 states and 19675 transitions. [2025-03-16 15:23:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-16 15:23:27,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:27,790 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:27,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:23:27,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:27,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash 754581254, now seen corresponding path program 1 times [2025-03-16 15:23:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780074092] [2025-03-16 15:23:27,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:27,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-16 15:23:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-16 15:23:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:23:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780074092] [2025-03-16 15:23:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780074092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129425305] [2025-03-16 15:23:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:28,185 INFO L87 Difference]: Start difference. First operand 17943 states and 19675 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:23:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:29,641 INFO L93 Difference]: Finished difference Result 43475 states and 47669 transitions. [2025-03-16 15:23:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:29,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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 545 [2025-03-16 15:23:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:29,662 INFO L225 Difference]: With dead ends: 43475 [2025-03-16 15:23:29,662 INFO L226 Difference]: Without dead ends: 25533 [2025-03-16 15:23:29,673 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:23:29,673 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 575 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 977 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:23:29,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 977 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:23:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2025-03-16 15:23:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 25533. [2025-03-16 15:23:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25533 states, 25532 states have (on average 1.08080056399812) internal successors, (27595), 25532 states have internal predecessors, (27595), 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:23:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25533 states to 25533 states and 27595 transitions. [2025-03-16 15:23:29,850 INFO L78 Accepts]: Start accepts. Automaton has 25533 states and 27595 transitions. Word has length 545 [2025-03-16 15:23:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:29,850 INFO L471 AbstractCegarLoop]: Abstraction has 25533 states and 27595 transitions. [2025-03-16 15:23:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:23:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25533 states and 27595 transitions. [2025-03-16 15:23:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-16 15:23:29,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:29,856 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, 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, 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] [2025-03-16 15:23:29,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:23:29,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:29,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:29,857 INFO L85 PathProgramCache]: Analyzing trace with hash 733925443, now seen corresponding path program 1 times [2025-03-16 15:23:29,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:29,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770963229] [2025-03-16 15:23:29,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:29,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-16 15:23:29,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-16 15:23:29,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:29,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-16 15:23:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770963229] [2025-03-16 15:23:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770963229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:30,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348637988] [2025-03-16 15:23:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:30,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:30,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:30,123 INFO L87 Difference]: Start difference. First operand 25533 states and 27595 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:23:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:31,523 INFO L93 Difference]: Finished difference Result 57965 states and 63541 transitions. [2025-03-16 15:23:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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 598 [2025-03-16 15:23:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:31,623 INFO L225 Difference]: With dead ends: 57965 [2025-03-16 15:23:31,623 INFO L226 Difference]: Without dead ends: 32433 [2025-03-16 15:23:31,634 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:23:31,636 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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:23:31,636 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:23:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32433 states. [2025-03-16 15:23:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32433 to 32433. [2025-03-16 15:23:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.08750616674889) internal successors, (35270), 32432 states have internal predecessors, (35270), 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:23:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 35270 transitions. [2025-03-16 15:23:31,994 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 35270 transitions. Word has length 598 [2025-03-16 15:23:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:31,994 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 35270 transitions. [2025-03-16 15:23:31,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:23:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 35270 transitions. [2025-03-16 15:23:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-16 15:23:31,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:31,999 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, 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, 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] [2025-03-16 15:23:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:23:32,000 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1462674034, now seen corresponding path program 1 times [2025-03-16 15:23:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004620000] [2025-03-16 15:23:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:32,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-16 15:23:32,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-16 15:23:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-16 15:23:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004620000] [2025-03-16 15:23:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004620000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255155823] [2025-03-16 15:23:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:32,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:32,250 INFO L87 Difference]: Start difference. First operand 32433 states and 35270 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:23:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:33,735 INFO L93 Difference]: Finished difference Result 74525 states and 81929 transitions. [2025-03-16 15:23:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 604 [2025-03-16 15:23:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:33,772 INFO L225 Difference]: With dead ends: 74525 [2025-03-16 15:23:33,772 INFO L226 Difference]: Without dead ends: 39333 [2025-03-16 15:23:33,793 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:23:33,794 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1119 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:23:33,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1119 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39333 states. [2025-03-16 15:23:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39333 to 39333. [2025-03-16 15:23:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39333 states, 39332 states have (on average 1.079350147462626) internal successors, (42453), 39332 states have internal predecessors, (42453), 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:23:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39333 states to 39333 states and 42453 transitions. [2025-03-16 15:23:34,116 INFO L78 Accepts]: Start accepts. Automaton has 39333 states and 42453 transitions. Word has length 604 [2025-03-16 15:23:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 39333 states and 42453 transitions. [2025-03-16 15:23:34,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:23:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 39333 states and 42453 transitions. [2025-03-16 15:23:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-16 15:23:34,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:34,121 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:23:34,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:34,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash -819248393, now seen corresponding path program 1 times [2025-03-16 15:23:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132910440] [2025-03-16 15:23:34,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-16 15:23:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 15:23:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-16 15:23:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132910440] [2025-03-16 15:23:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132910440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:23:34,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557069905] [2025-03-16 15:23:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:23:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:34,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:23:34,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:34,717 INFO L87 Difference]: Start difference. First operand 39333 states and 42453 transitions. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:23:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:36,576 INFO L93 Difference]: Finished difference Result 88420 states and 96336 transitions. [2025-03-16 15:23:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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 622 [2025-03-16 15:23:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:36,614 INFO L225 Difference]: With dead ends: 88420 [2025-03-16 15:23:36,614 INFO L226 Difference]: Without dead ends: 46328 [2025-03-16 15:23:36,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:23:36,632 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1441 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 922 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 3357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 922 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:36,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1059 Invalid, 3357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [922 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46328 states. [2025-03-16 15:23:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46328 to 44163. [2025-03-16 15:23:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44163 states, 44162 states have (on average 1.046419999094244) internal successors, (46212), 44162 states have internal predecessors, (46212), 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:23:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 46212 transitions. [2025-03-16 15:23:37,056 INFO L78 Accepts]: Start accepts. Automaton has 44163 states and 46212 transitions. Word has length 622 [2025-03-16 15:23:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 44163 states and 46212 transitions. [2025-03-16 15:23:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:23:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44163 states and 46212 transitions. [2025-03-16 15:23:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-16 15:23:37,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:37,071 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:23:37,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:37,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1941095745, now seen corresponding path program 1 times [2025-03-16 15:23:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940198486] [2025-03-16 15:23:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:37,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-16 15:23:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-16 15:23:37,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:37,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-03-16 15:23:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940198486] [2025-03-16 15:23:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940198486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008045304] [2025-03-16 15:23:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:37,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:37,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:37,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:37,376 INFO L87 Difference]: Start difference. First operand 44163 states and 46212 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:23:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:38,927 INFO L93 Difference]: Finished difference Result 106955 states and 112430 transitions. [2025-03-16 15:23:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 777 [2025-03-16 15:23:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:38,994 INFO L225 Difference]: With dead ends: 106955 [2025-03-16 15:23:38,994 INFO L226 Difference]: Without dead ends: 62793 [2025-03-16 15:23:39,026 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:23:39,027 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 574 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:39,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 107 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62793 states. [2025-03-16 15:23:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62793 to 62793. [2025-03-16 15:23:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62793 states, 62792 states have (on average 1.050070072620716) internal successors, (65936), 62792 states have internal predecessors, (65936), 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:23:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62793 states to 62793 states and 65936 transitions. [2025-03-16 15:23:39,723 INFO L78 Accepts]: Start accepts. Automaton has 62793 states and 65936 transitions. Word has length 777 [2025-03-16 15:23:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:39,724 INFO L471 AbstractCegarLoop]: Abstraction has 62793 states and 65936 transitions. [2025-03-16 15:23:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:23:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62793 states and 65936 transitions. [2025-03-16 15:23:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2025-03-16 15:23:39,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:39,738 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, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:39,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:23:39,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:39,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash 229197294, now seen corresponding path program 1 times [2025-03-16 15:23:39,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:39,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988662945] [2025-03-16 15:23:39,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 864 statements into 1 equivalence classes. [2025-03-16 15:23:39,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 864 of 864 statements. [2025-03-16 15:23:39,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:39,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2025-03-16 15:23:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988662945] [2025-03-16 15:23:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988662945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645086754] [2025-03-16 15:23:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:40,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:40,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:40,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:40,197 INFO L87 Difference]: Start difference. First operand 62793 states and 65936 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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:23:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:41,702 INFO L93 Difference]: Finished difference Result 136625 states and 143682 transitions. [2025-03-16 15:23:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:41,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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 864 [2025-03-16 15:23:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:41,773 INFO L225 Difference]: With dead ends: 136625 [2025-03-16 15:23:41,773 INFO L226 Difference]: Without dead ends: 73143 [2025-03-16 15:23:41,811 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:23:41,812 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 612 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:41,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 269 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73143 states. [2025-03-16 15:23:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73143 to 63483. [2025-03-16 15:23:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63483 states, 63482 states have (on average 1.0494943448536593) internal successors, (66624), 63482 states have internal predecessors, (66624), 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:23:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63483 states to 63483 states and 66624 transitions. [2025-03-16 15:23:42,554 INFO L78 Accepts]: Start accepts. Automaton has 63483 states and 66624 transitions. Word has length 864 [2025-03-16 15:23:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:42,555 INFO L471 AbstractCegarLoop]: Abstraction has 63483 states and 66624 transitions. [2025-03-16 15:23:42,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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:23:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 63483 states and 66624 transitions. [2025-03-16 15:23:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-03-16 15:23:42,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:42,581 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, 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, 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] [2025-03-16 15:23:42,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:23:42,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:42,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1334705310, now seen corresponding path program 1 times [2025-03-16 15:23:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:42,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978161050] [2025-03-16 15:23:42,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:42,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-03-16 15:23:42,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-03-16 15:23:42,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:42,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 15:23:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978161050] [2025-03-16 15:23:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978161050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918112714] [2025-03-16 15:23:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:43,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:43,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:43,058 INFO L87 Difference]: Start difference. First operand 63483 states and 66624 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:23:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:44,383 INFO L93 Difference]: Finished difference Result 129035 states and 135351 transitions. [2025-03-16 15:23:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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 911 [2025-03-16 15:23:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:44,440 INFO L225 Difference]: With dead ends: 129035 [2025-03-16 15:23:44,440 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:23:44,472 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:23:44,473 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 615 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:44,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 931 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:23:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:23:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 62103. [2025-03-16 15:23:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62103 states, 62102 states have (on average 1.0303371872081415) internal successors, (63986), 62102 states have internal predecessors, (63986), 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:23:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62103 states to 62103 states and 63986 transitions. [2025-03-16 15:23:45,165 INFO L78 Accepts]: Start accepts. Automaton has 62103 states and 63986 transitions. Word has length 911 [2025-03-16 15:23:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 62103 states and 63986 transitions. [2025-03-16 15:23:45,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:23:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62103 states and 63986 transitions. [2025-03-16 15:23:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2025-03-16 15:23:45,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:45,190 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, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:23:45,191 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:45,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash -469934359, now seen corresponding path program 1 times [2025-03-16 15:23:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500943355] [2025-03-16 15:23:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 930 statements into 1 equivalence classes. [2025-03-16 15:23:45,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 930 of 930 statements. [2025-03-16 15:23:45,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:45,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 966 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 15:23:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500943355] [2025-03-16 15:23:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500943355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475917226] [2025-03-16 15:23:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:45,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:45,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:45,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:45,881 INFO L87 Difference]: Start difference. First operand 62103 states and 63986 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:23:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:47,303 INFO L93 Difference]: Finished difference Result 134555 states and 138746 transitions. [2025-03-16 15:23:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:47,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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 930 [2025-03-16 15:23:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:47,365 INFO L225 Difference]: With dead ends: 134555 [2025-03-16 15:23:47,365 INFO L226 Difference]: Without dead ends: 72453 [2025-03-16 15:23:47,386 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:23:47,386 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 586 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:47,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 268 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72453 states. [2025-03-16 15:23:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72453 to 71763. [2025-03-16 15:23:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71763 states, 71762 states have (on average 1.028092862517767) internal successors, (73778), 71762 states have internal predecessors, (73778), 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:23:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71763 states to 71763 states and 73778 transitions. [2025-03-16 15:23:47,909 INFO L78 Accepts]: Start accepts. Automaton has 71763 states and 73778 transitions. Word has length 930 [2025-03-16 15:23:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:47,909 INFO L471 AbstractCegarLoop]: Abstraction has 71763 states and 73778 transitions. [2025-03-16 15:23:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:23:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 71763 states and 73778 transitions. [2025-03-16 15:23:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2025-03-16 15:23:47,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:47,946 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:47,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:23:47,946 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:47,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash 816463273, now seen corresponding path program 1 times [2025-03-16 15:23:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095947462] [2025-03-16 15:23:47,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1498 statements into 1 equivalence classes. [2025-03-16 15:23:48,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1498 of 1498 statements. [2025-03-16 15:23:48,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:48,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 1363 proven. 0 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2025-03-16 15:23:48,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:48,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095947462] [2025-03-16 15:23:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095947462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:48,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813789956] [2025-03-16 15:23:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:48,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:48,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:48,743 INFO L87 Difference]: Start difference. First operand 71763 states and 73778 transitions. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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:23:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:50,205 INFO L93 Difference]: Finished difference Result 142835 states and 146864 transitions. [2025-03-16 15:23:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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 1498 [2025-03-16 15:23:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:50,277 INFO L225 Difference]: With dead ends: 142835 [2025-03-16 15:23:50,277 INFO L226 Difference]: Without dead ends: 71763 [2025-03-16 15:23:50,316 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:23:50,317 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 623 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:50,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 883 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:23:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71763 states. [2025-03-16 15:23:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71763 to 69003. [2025-03-16 15:23:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69003 states, 69002 states have (on average 1.0200718819744354) internal successors, (70387), 69002 states have internal predecessors, (70387), 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:23:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69003 states to 69003 states and 70387 transitions. [2025-03-16 15:23:51,309 INFO L78 Accepts]: Start accepts. Automaton has 69003 states and 70387 transitions. Word has length 1498 [2025-03-16 15:23:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:51,310 INFO L471 AbstractCegarLoop]: Abstraction has 69003 states and 70387 transitions. [2025-03-16 15:23:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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:23:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 69003 states and 70387 transitions. [2025-03-16 15:23:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1504 [2025-03-16 15:23:51,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:51,334 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, 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, 6, 6, 6, 6, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:23:51,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:51,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash -652925265, now seen corresponding path program 1 times [2025-03-16 15:23:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494047927] [2025-03-16 15:23:51,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:51,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:51,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1503 statements into 1 equivalence classes. [2025-03-16 15:23:51,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1503 of 1503 statements. [2025-03-16 15:23:51,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:51,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3176 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 2833 trivial. 0 not checked. [2025-03-16 15:23:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494047927] [2025-03-16 15:23:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494047927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051606396] [2025-03-16 15:23:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:52,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:52,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:52,058 INFO L87 Difference]: Start difference. First operand 69003 states and 70387 transitions. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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:23:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:53,477 INFO L93 Difference]: Finished difference Result 149735 states and 152863 transitions. [2025-03-16 15:23:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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 1503 [2025-03-16 15:23:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:53,556 INFO L225 Difference]: With dead ends: 149735 [2025-03-16 15:23:53,556 INFO L226 Difference]: Without dead ends: 80733 [2025-03-16 15:23:53,598 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:23:53,598 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:53,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 940 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:23:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80733 states. [2025-03-16 15:23:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80733 to 77973. [2025-03-16 15:23:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77973 states, 77972 states have (on average 1.018506643410455) internal successors, (79415), 77972 states have internal predecessors, (79415), 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:23:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77973 states to 77973 states and 79415 transitions. [2025-03-16 15:23:54,411 INFO L78 Accepts]: Start accepts. Automaton has 77973 states and 79415 transitions. Word has length 1503 [2025-03-16 15:23:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 77973 states and 79415 transitions. [2025-03-16 15:23:54,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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:23:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 77973 states and 79415 transitions. [2025-03-16 15:23:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2025-03-16 15:23:54,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:54,474 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:54,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:23:54,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:54,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1174509452, now seen corresponding path program 1 times [2025-03-16 15:23:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:54,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554007443] [2025-03-16 15:23:54,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:54,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:23:54,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:23:54,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:54,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1869 proven. 94 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-03-16 15:23:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554007443] [2025-03-16 15:23:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554007443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942289427] [2025-03-16 15:23:56,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:56,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:56,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:56,794 INFO L229 MonitoredProcess]: Starting monitored process 3 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:23:56,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:23:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:23:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:23:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:57,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1974 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:23:57,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1893 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-16 15:23:57,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:57,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942289427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:57,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:57,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 15:23:57,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73519216] [2025-03-16 15:23:57,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:57,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:57,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:57,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:23:57,214 INFO L87 Difference]: Start difference. First operand 77973 states and 79415 transitions. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:23:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:58,555 INFO L93 Difference]: Finished difference Result 156635 states and 159536 transitions. [2025-03-16 15:23:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:58,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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 1747 [2025-03-16 15:23:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:58,634 INFO L225 Difference]: With dead ends: 156635 [2025-03-16 15:23:58,635 INFO L226 Difference]: Without dead ends: 79353 [2025-03-16 15:23:58,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1750 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:23:58,678 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 615 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:58,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 916 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:23:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79353 states. [2025-03-16 15:23:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79353 to 75903. [2025-03-16 15:23:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75903 states, 75902 states have (on average 1.0154936628810836) internal successors, (77078), 75902 states have internal predecessors, (77078), 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:23:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75903 states to 75903 states and 77078 transitions. [2025-03-16 15:23:59,264 INFO L78 Accepts]: Start accepts. Automaton has 75903 states and 77078 transitions. Word has length 1747 [2025-03-16 15:23:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 75903 states and 77078 transitions. [2025-03-16 15:23:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:23:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 75903 states and 77078 transitions. [2025-03-16 15:23:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1889 [2025-03-16 15:23:59,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:59,341 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:59,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:23:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 15:23:59,542 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2090447923, now seen corresponding path program 1 times [2025-03-16 15:23:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:59,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041768632] [2025-03-16 15:23:59,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:59,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:59,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1888 statements into 1 equivalence classes. [2025-03-16 15:23:59,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1888 of 1888 statements. [2025-03-16 15:23:59,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3101 backedges. 2135 proven. 0 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2025-03-16 15:24:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041768632] [2025-03-16 15:24:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041768632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318389754] [2025-03-16 15:24:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:00,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:00,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:00,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:00,926 INFO L87 Difference]: Start difference. First operand 75903 states and 77078 transitions. Second operand has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 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:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:02,435 INFO L93 Difference]: Finished difference Result 169743 states and 172412 transitions. [2025-03-16 15:24:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 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 1888 [2025-03-16 15:24:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:02,439 INFO L225 Difference]: With dead ends: 169743 [2025-03-16 15:24:02,439 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:24:02,489 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:02,491 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 613 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:02,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 228 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:24:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:24:02,492 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:24:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:24:02,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1888 [2025-03-16 15:24:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:02,492 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:24:02,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 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:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:24:02,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:24:02,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:24:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:24:02,497 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, 1] [2025-03-16 15:24:02,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:24:05,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:24:05,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:24:05 BoogieIcfgContainer [2025-03-16 15:24:05,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:24:05,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:24:05,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:24:05,225 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:24:05,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:04" (3/4) ... [2025-03-16 15:24:05,231 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:24:05,277 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 15:24:05,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:24:05,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:24:05,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:24:05,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:24:05,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:24:05,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:24:05,493 INFO L158 Benchmark]: Toolchain (without parser) took 65176.85ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 101.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.1GB. Max. memory is 16.1GB. [2025-03-16 15:24:05,493 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:24:05,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 871.77ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 56.0MB in the end (delta: 45.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2025-03-16 15:24:05,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.74ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 69.9MB in the end (delta: -13.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-16 15:24:05,495 INFO L158 Benchmark]: Boogie Preprocessor took 235.86ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 54.3MB in the end (delta: 15.5MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-03-16 15:24:05,495 INFO L158 Benchmark]: IcfgBuilder took 2923.07ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 54.3MB in the beginning and 186.2MB in the end (delta: -131.9MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. [2025-03-16 15:24:05,495 INFO L158 Benchmark]: TraceAbstraction took 60701.55ms. Allocated memory was 285.2MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 186.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 4.9GB. Max. memory is 16.1GB. [2025-03-16 15:24:05,495 INFO L158 Benchmark]: Witness Printer took 266.79ms. Allocated memory is still 7.3GB. Free memory was 2.3GB in the beginning and 2.2GB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:24:05,496 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.54ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 871.77ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 56.0MB in the end (delta: 45.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.74ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 69.9MB in the end (delta: -13.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 235.86ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 54.3MB in the end (delta: 15.5MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2923.07ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 54.3MB in the beginning and 186.2MB in the end (delta: -131.9MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60701.55ms. Allocated memory was 285.2MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 186.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 4.9GB. Max. memory is 16.1GB. * Witness Printer took 266.79ms. Allocated memory is still 7.3GB. Free memory was 2.3GB in the beginning and 2.2GB 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: 154]: 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.9s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14958 SdHoareTripleChecker+Valid, 32.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14958 mSDsluCounter, 14956 SdHoareTripleChecker+Invalid, 26.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 8639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43317 IncrementalHoareTripleChecker+Invalid, 51956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8639 mSolverCounterUnsat, 14815 mSDtfsCounter, 43317 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2299 GetRequests, 2266 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77973occurred in iteration=20, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 26315 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 17819 NumberOfCodeBlocks, 17819 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 17795 ConstructedInterpolants, 0 QuantifiedInterpolants, 27779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 24039/24165 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: ((((((((((((((((((((((((((((((((((((a15 <= 4) && (a18 == 11)) && (a3 <= 99)) || (((a24 == 3) && (a15 <= 4)) && (a3 <= 417))) || ((a24 == 3) && (5 == a15))) || (((a24 == 2) && (a3 <= 417)) && (a15 == 6))) || (((5 == a15) && (4 <= a24)) && (a3 <= 99))) || (((a24 == 0) && (5 == a15)) && (a18 == 11))) || (((5 == a15) && (a24 == 2)) && (a18 == 9))) || (((a15 <= 4) && (a3 <= 417)) && (4 <= a24))) || (((a24 == 3) && (a18 == 10)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 == 2))) || (((a15 <= 4) && (a18 == 11)) && (4 <= a24))) || ((a24 == 0) && (a15 == 6))) || (((a24 == 3) && (a3 <= 306)) && (a15 == 6))) || (((a3 <= 306) && (a24 == 0)) && (a15 <= 4))) || (((a18 <= 10) && (a24 == 0)) && (5 == a15))) || (((a18 <= 10) && (a24 == 1)) && (a15 == 6))) || ((((a18 <= 10) && (5 == a15)) && (a3 <= 417)) && (4 <= a24))) || ((a18 <= 10) && (a15 <= 4))) || (((5 == a15) && (a24 == 2)) && (12 <= a18))) || ((((a24 == 0) && (a15 <= 4)) && (a18 == 11)) && (a3 <= 417))) || (((a24 == 3) && (a18 == 9)) && (a15 == 6))) || (((a24 == 0) && (5 == a15)) && (a3 <= 417))) || (((5 == a15) && (a18 == 10)) && (4 <= a24))) || ((a24 == 1) && (5 == a15))) || (((a24 == 1) && (a18 == 11)) && (a15 == 6))) || (((a24 == 3) && (a18 == 11)) && (a15 == 6))) || (((a24 == 1) && (a3 <= 417)) && (a15 == 6))) || ((((a18 <= 10) && (a24 == 3)) && (a3 <= 417)) && (a15 == 6))) || (((a3 <= 306) && (5 == a15)) && (a24 == 2))) || (((a24 == 2) && (a15 == 6)) && (12 <= a18))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a24 == 2))) || ((((5 == a15) && (a18 == 11)) && (a3 <= 417)) && (4 <= a24))) || (((a18 <= 10) && (a24 == 2)) && (a15 == 6))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:24:05,512 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