./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label44.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/Problem16_label44.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 04df7a0e588187c87d0a6786097052b38b84b414452cc5f4314f9898df1c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:14:48,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:14:48,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:14:48,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:14:48,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:14:48,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:14:48,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:14:48,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:14:48,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:14:48,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:14:48,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:14:48,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:14:48,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:14:48,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:14:48,678 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:14:48,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:14:48,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:14:48,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:14:48,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:48,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:14:48,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:14:48,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:14:48,681 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 -> 04df7a0e588187c87d0a6786097052b38b84b414452cc5f4314f9898df1c2d34 [2025-03-16 15:14:48,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:14:48,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:14:48,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:14:48,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:14:48,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:14:48,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label44.c [2025-03-16 15:14:49,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14cf2ab/6c21bb666d6c4182a34b5ffb0887a7a6/FLAG76ffb7f1b [2025-03-16 15:14:50,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:14:50,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label44.c [2025-03-16 15:14:50,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14cf2ab/6c21bb666d6c4182a34b5ffb0887a7a6/FLAG76ffb7f1b [2025-03-16 15:14:50,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14cf2ab/6c21bb666d6c4182a34b5ffb0887a7a6 [2025-03-16 15:14:50,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:14:50,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:14:50,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:50,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:14:50,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:14:50,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:50,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50, skipping insertion in model container [2025-03-16 15:14:50,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:50,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:14:50,555 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/Problem16_label44.c[3342,3355] [2025-03-16 15:14:50,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:50,788 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:14:50,801 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/Problem16_label44.c[3342,3355] [2025-03-16 15:14:50,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:50,913 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:14:50,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50 WrapperNode [2025-03-16 15:14:50,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:50,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:50,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:14:50,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:14:50,921 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:14:50" (1/1) ... [2025-03-16 15:14:50,951 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:14:50" (1/1) ... [2025-03-16 15:14:51,068 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:14:51,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:51,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:14:51,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:14:51,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:14:51,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,133 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:14:51,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:14:51,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:14:51,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:14:51,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:14:51,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (1/1) ... [2025-03-16 15:14:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:51,235 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:14:51,240 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:14:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:14:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:14:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:14:51,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:14:51,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:14:51,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:14:52,778 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:14:52,847 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:14:52,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:14:52,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:14:52,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:14:52,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:52 BoogieIcfgContainer [2025-03-16 15:14:52,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:14:52,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:14:52,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:14:52,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:14:52,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:14:50" (1/3) ... [2025-03-16 15:14:52,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de51765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:52, skipping insertion in model container [2025-03-16 15:14:52,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:50" (2/3) ... [2025-03-16 15:14:52,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de51765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:52, skipping insertion in model container [2025-03-16 15:14:52,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:52" (3/3) ... [2025-03-16 15:14:52,875 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label44.c [2025-03-16 15:14:52,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:14:52,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label44.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:14:52,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:14:52,951 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;@debf41b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:14:52,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:14:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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:14:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:14:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:52,961 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] [2025-03-16 15:14:52,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:52,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 856444618, now seen corresponding path program 1 times [2025-03-16 15:14:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968658964] [2025-03-16 15:14:52,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:53,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:14:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:14:53,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:53,084 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:14:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968658964] [2025-03-16 15:14:53,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968658964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587116673] [2025-03-16 15:14:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:14:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:53,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:14:53,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:14:53,111 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:14:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:53,156 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:14:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:14:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2025-03-16 15:14:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:53,168 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:14:53,168 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:14:53,173 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:14:53,175 INFO L435 NwaCegarLoop]: 599 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, 599 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:14:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:14:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:14:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:14:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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:14:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:14:53,230 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 29 [2025-03-16 15:14:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:53,232 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:14:53,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:14:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:14:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:14:53,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:53,233 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] [2025-03-16 15:14:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:14:53,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:53,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 745332810, now seen corresponding path program 1 times [2025-03-16 15:14:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922896765] [2025-03-16 15:14:53,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:14:53,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:14:53,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:53,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:53,379 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:14:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922896765] [2025-03-16 15:14:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922896765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773096792] [2025-03-16 15:14:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:53,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:53,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:53,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:53,385 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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:14:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:54,570 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:14:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2025-03-16 15:14:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:54,574 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:14:54,574 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:14:54,575 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:14:54,575 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 341 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:54,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:14:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:14:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:14:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 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:14:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2025-03-16 15:14:54,595 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 29 [2025-03-16 15:14:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2025-03-16 15:14:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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:14:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2025-03-16 15:14:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 15:14:54,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:54,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:54,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:14:54,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1174047980, now seen corresponding path program 1 times [2025-03-16 15:14:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605624415] [2025-03-16 15:14:54,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 15:14:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 15:14:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:14:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605624415] [2025-03-16 15:14:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605624415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685229469] [2025-03-16 15:14:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:54,902 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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:14:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:56,461 INFO L93 Difference]: Finished difference Result 2308 states and 3413 transitions. [2025-03-16 15:14:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:14:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-03-16 15:14:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:56,468 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:14:56,468 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:14:56,469 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:14:56,469 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1005 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:56,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 43 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:14:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:14:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:14:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4013357619914997) internal successors, (2308), 1647 states have internal predecessors, (2308), 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:14:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2308 transitions. [2025-03-16 15:14:56,514 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2308 transitions. Word has length 97 [2025-03-16 15:14:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2308 transitions. [2025-03-16 15:14:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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:14:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2308 transitions. [2025-03-16 15:14:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 15:14:56,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:56,526 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:14:56,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:14:56,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 154158815, now seen corresponding path program 1 times [2025-03-16 15:14:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496760696] [2025-03-16 15:14:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:56,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 15:14:56,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 15:14:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:14:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496760696] [2025-03-16 15:14:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496760696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303276026] [2025-03-16 15:14:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:56,821 INFO L87 Difference]: Start difference. First operand 1648 states and 2308 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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:14:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:57,831 INFO L93 Difference]: Finished difference Result 3624 states and 5238 transitions. [2025-03-16 15:14:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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 257 [2025-03-16 15:14:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:57,841 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:14:57,841 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:14:57,842 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:14:57,842 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:57,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:14:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:14:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:14:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.349240780911063) internal successors, (3110), 2305 states have internal predecessors, (3110), 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:14:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3110 transitions. [2025-03-16 15:14:57,882 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3110 transitions. Word has length 257 [2025-03-16 15:14:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:57,883 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3110 transitions. [2025-03-16 15:14:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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:14:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3110 transitions. [2025-03-16 15:14:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-16 15:14:57,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:57,888 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:57,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:14:57,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash -927189261, now seen corresponding path program 1 times [2025-03-16 15:14:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601196344] [2025-03-16 15:14:57,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 15:14:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 15:14:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:14:58,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601196344] [2025-03-16 15:14:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601196344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331684529] [2025-03-16 15:14:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:58,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:58,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:58,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:58,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:58,103 INFO L87 Difference]: Start difference. First operand 2306 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:14:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:59,094 INFO L93 Difference]: Finished difference Result 5598 states and 7693 transitions. [2025-03-16 15:14:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 292 [2025-03-16 15:14:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:59,106 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:14:59,106 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:14:59,109 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:14:59,111 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:59,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:14:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:14:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3293. [2025-03-16 15:14:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.2357229647630619) internal successors, (4068), 3292 states have internal predecessors, (4068), 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:14:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4068 transitions. [2025-03-16 15:14:59,154 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4068 transitions. Word has length 292 [2025-03-16 15:14:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:59,156 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 4068 transitions. [2025-03-16 15:14:59,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:14:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4068 transitions. [2025-03-16 15:14:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-16 15:14:59,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:59,162 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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:14:59,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:14:59,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:59,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 83103562, now seen corresponding path program 1 times [2025-03-16 15:14:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341207139] [2025-03-16 15:14:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:59,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-16 15:14:59,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-16 15:14:59,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:59,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2025-03-16 15:14:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:59,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341207139] [2025-03-16 15:14:59,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341207139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:59,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:59,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:59,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345578752] [2025-03-16 15:14:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:59,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:59,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:59,446 INFO L87 Difference]: Start difference. First operand 3293 states and 4068 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:15:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:00,381 INFO L93 Difference]: Finished difference Result 7572 states and 9416 transitions. [2025-03-16 15:15:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:00,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:15:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:00,390 INFO L225 Difference]: With dead ends: 7572 [2025-03-16 15:15:00,390 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:15:00,393 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:15:00,394 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 286 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:00,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 538 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:15:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:15:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2025-03-16 15:15:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.0729113924050633) internal successors, (4238), 3950 states have internal predecessors, (4238), 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:15:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4238 transitions. [2025-03-16 15:15:00,462 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4238 transitions. Word has length 545 [2025-03-16 15:15:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:00,462 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4238 transitions. [2025-03-16 15:15:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:15:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4238 transitions. [2025-03-16 15:15:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-16 15:15:00,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:00,481 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:00,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:15:00,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:00,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 545705912, now seen corresponding path program 1 times [2025-03-16 15:15:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716676477] [2025-03-16 15:15:00,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:00,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:00,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-16 15:15:00,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-16 15:15:00,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:00,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2025-03-16 15:15:01,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716676477] [2025-03-16 15:15:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716676477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004622749] [2025-03-16 15:15:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:15:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:01,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:15:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:15:01,509 INFO L87 Difference]: Start difference. First operand 3951 states and 4238 transitions. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 3 states have internal predecessors, (575), 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:15:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:02,119 INFO L93 Difference]: Finished difference Result 7901 states and 8487 transitions. [2025-03-16 15:15:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 3 states have internal predecessors, (575), 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 817 [2025-03-16 15:15:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:02,128 INFO L225 Difference]: With dead ends: 7901 [2025-03-16 15:15:02,128 INFO L226 Difference]: Without dead ends: 4280 [2025-03-16 15:15:02,131 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:15:02,131 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:02,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 104 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2025-03-16 15:15:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2025-03-16 15:15:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.068240243047441) internal successors, (4571), 4279 states have internal predecessors, (4571), 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:15:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 4571 transitions. [2025-03-16 15:15:02,174 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 4571 transitions. Word has length 817 [2025-03-16 15:15:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:02,175 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 4571 transitions. [2025-03-16 15:15:02,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 3 states have internal predecessors, (575), 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:15:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 4571 transitions. [2025-03-16 15:15:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-03-16 15:15:02,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:02,182 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:15:02,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:15:02,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:02,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -536894072, now seen corresponding path program 1 times [2025-03-16 15:15:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675383869] [2025-03-16 15:15:02,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-16 15:15:02,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-16 15:15:02,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:02,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1358 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-16 15:15:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675383869] [2025-03-16 15:15:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675383869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47472625] [2025-03-16 15:15:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:02,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:02,882 INFO L87 Difference]: Start difference. First operand 4280 states and 4571 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:15:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:03,543 INFO L93 Difference]: Finished difference Result 9546 states and 10260 transitions. [2025-03-16 15:15:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:03,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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 921 [2025-03-16 15:15:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:03,557 INFO L225 Difference]: With dead ends: 9546 [2025-03-16 15:15:03,557 INFO L226 Difference]: Without dead ends: 5925 [2025-03-16 15:15:03,560 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:15:03,560 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:03,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 35 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2025-03-16 15:15:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2025-03-16 15:15:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.063133018230925) internal successors, (6298), 5924 states have internal predecessors, (6298), 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:15:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6298 transitions. [2025-03-16 15:15:03,625 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6298 transitions. Word has length 921 [2025-03-16 15:15:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:03,626 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6298 transitions. [2025-03-16 15:15:03,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:15:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6298 transitions. [2025-03-16 15:15:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2025-03-16 15:15:03,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:03,638 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:15:03,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -764982468, now seen corresponding path program 1 times [2025-03-16 15:15:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028567546] [2025-03-16 15:15:03,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:03,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-03-16 15:15:03,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-03-16 15:15:03,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:03,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 1827 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-16 15:15:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028567546] [2025-03-16 15:15:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028567546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:04,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:04,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734372998] [2025-03-16 15:15:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:04,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:04,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:04,163 INFO L87 Difference]: Start difference. First operand 5925 states and 6298 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 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:15:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:04,790 INFO L93 Difference]: Finished difference Result 12507 states and 13370 transitions. [2025-03-16 15:15:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 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 1148 [2025-03-16 15:15:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:04,805 INFO L225 Difference]: With dead ends: 12507 [2025-03-16 15:15:04,805 INFO L226 Difference]: Without dead ends: 7241 [2025-03-16 15:15:04,810 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:15:04,810 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:04,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 426 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2025-03-16 15:15:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 6912. [2025-03-16 15:15:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 1.0557082911300826) internal successors, (7296), 6911 states have internal predecessors, (7296), 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:15:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 7296 transitions. [2025-03-16 15:15:04,874 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 7296 transitions. Word has length 1148 [2025-03-16 15:15:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:04,875 INFO L471 AbstractCegarLoop]: Abstraction has 6912 states and 7296 transitions. [2025-03-16 15:15:04,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 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:15:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 7296 transitions. [2025-03-16 15:15:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2025-03-16 15:15:04,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:04,905 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:04,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:15:04,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash -767735052, now seen corresponding path program 1 times [2025-03-16 15:15:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967299466] [2025-03-16 15:15:04,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:04,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1149 statements into 1 equivalence classes. [2025-03-16 15:15:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1149 of 1149 statements. [2025-03-16 15:15:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2638 backedges. 1816 proven. 0 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2025-03-16 15:15:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967299466] [2025-03-16 15:15:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967299466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607501243] [2025-03-16 15:15:05,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:05,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:05,477 INFO L87 Difference]: Start difference. First operand 6912 states and 7296 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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:15:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:05,994 INFO L93 Difference]: Finished difference Result 14481 states and 15332 transitions. [2025-03-16 15:15:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 1149 [2025-03-16 15:15:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:06,013 INFO L225 Difference]: With dead ends: 14481 [2025-03-16 15:15:06,013 INFO L226 Difference]: Without dead ends: 8228 [2025-03-16 15:15:06,018 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:15:06,019 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:06,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 422 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2025-03-16 15:15:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 8228. [2025-03-16 15:15:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8228 states, 8227 states have (on average 1.050200559134557) internal successors, (8640), 8227 states have internal predecessors, (8640), 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:15:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 8640 transitions. [2025-03-16 15:15:06,082 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 8640 transitions. Word has length 1149 [2025-03-16 15:15:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 8228 states and 8640 transitions. [2025-03-16 15:15:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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:15:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 8640 transitions. [2025-03-16 15:15:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2025-03-16 15:15:06,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:06,095 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:06,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:15:06,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:06,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1703129628, now seen corresponding path program 1 times [2025-03-16 15:15:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037789089] [2025-03-16 15:15:06,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1177 statements into 1 equivalence classes. [2025-03-16 15:15:06,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1177 of 1177 statements. [2025-03-16 15:15:06,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:06,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2746 backedges. 1525 proven. 0 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2025-03-16 15:15:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037789089] [2025-03-16 15:15:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037789089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:06,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159156451] [2025-03-16 15:15:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:06,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:06,869 INFO L87 Difference]: Start difference. First operand 8228 states and 8640 transitions. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:15:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:07,451 INFO L93 Difference]: Finished difference Result 16784 states and 17617 transitions. [2025-03-16 15:15:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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 1177 [2025-03-16 15:15:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:07,465 INFO L225 Difference]: With dead ends: 16784 [2025-03-16 15:15:07,465 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:15:07,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:15:07,472 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:07,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 436 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:15:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:15:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0455828087692642) internal successors, (9634), 9214 states have internal predecessors, (9634), 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:15:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9634 transitions. [2025-03-16 15:15:07,565 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9634 transitions. Word has length 1177 [2025-03-16 15:15:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9634 transitions. [2025-03-16 15:15:07,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:15:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9634 transitions. [2025-03-16 15:15:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2025-03-16 15:15:07,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:07,589 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:15:07,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 867537778, now seen corresponding path program 1 times [2025-03-16 15:15:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:07,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436441148] [2025-03-16 15:15:07,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:07,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-03-16 15:15:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-03-16 15:15:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 1612 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-03-16 15:15:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436441148] [2025-03-16 15:15:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436441148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:15:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613705423] [2025-03-16 15:15:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:15:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:15:08,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:15:08,576 INFO L87 Difference]: Start difference. First operand 9215 states and 9634 transitions. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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:15:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:09,389 INFO L93 Difference]: Finished difference Result 17778 states and 18610 transitions. [2025-03-16 15:15:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:15:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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 1188 [2025-03-16 15:15:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:09,402 INFO L225 Difference]: With dead ends: 17778 [2025-03-16 15:15:09,402 INFO L226 Difference]: Without dead ends: 9222 [2025-03-16 15:15:09,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:15:09,409 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:09,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:15:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9222 states. [2025-03-16 15:15:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9222 to 9215. [2025-03-16 15:15:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0453657477751248) internal successors, (9632), 9214 states have internal predecessors, (9632), 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:15:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9632 transitions. [2025-03-16 15:15:09,476 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9632 transitions. Word has length 1188 [2025-03-16 15:15:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:09,476 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9632 transitions. [2025-03-16 15:15:09,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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:15:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9632 transitions. [2025-03-16 15:15:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2025-03-16 15:15:09,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:09,488 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:09,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:15:09,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1014631129, now seen corresponding path program 1 times [2025-03-16 15:15:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897015932] [2025-03-16 15:15:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1195 statements into 1 equivalence classes. [2025-03-16 15:15:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1195 of 1195 statements. [2025-03-16 15:15:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 1111 proven. 942 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:15:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897015932] [2025-03-16 15:15:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897015932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223168744] [2025-03-16 15:15:10,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:10,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:10,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:10,554 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:15:10,555 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:15:10,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1195 statements into 1 equivalence classes. [2025-03-16 15:15:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1195 of 1195 statements. [2025-03-16 15:15:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:10,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:15:10,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 1636 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2025-03-16 15:15:11,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223168744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:11,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:15:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949913224] [2025-03-16 15:15:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:11,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:11,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:11,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:11,317 INFO L87 Difference]: Start difference. First operand 9215 states and 9632 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 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:15:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:11,833 INFO L93 Difference]: Finished difference Result 17771 states and 18599 transitions. [2025-03-16 15:15:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 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 1195 [2025-03-16 15:15:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:11,846 INFO L225 Difference]: With dead ends: 17771 [2025-03-16 15:15:11,846 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:15:11,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:11,852 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:11,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 375 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:15:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:15:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0395051009333622) internal successors, (9578), 9214 states have internal predecessors, (9578), 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:15:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9578 transitions. [2025-03-16 15:15:11,914 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9578 transitions. Word has length 1195 [2025-03-16 15:15:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9578 transitions. [2025-03-16 15:15:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 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:15:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9578 transitions. [2025-03-16 15:15:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1264 [2025-03-16 15:15:11,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:11,928 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:15:11,936 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:15:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:15:12,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2026018447, now seen corresponding path program 1 times [2025-03-16 15:15:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568483201] [2025-03-16 15:15:12,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:12,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1263 statements into 1 equivalence classes. [2025-03-16 15:15:12,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1263 of 1263 statements. [2025-03-16 15:15:12,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3277 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 2581 trivial. 0 not checked. [2025-03-16 15:15:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568483201] [2025-03-16 15:15:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568483201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905092255] [2025-03-16 15:15:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:12,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:12,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:12,623 INFO L87 Difference]: Start difference. First operand 9215 states and 9578 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:15:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:13,133 INFO L93 Difference]: Finished difference Result 18100 states and 18824 transitions. [2025-03-16 15:15:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 1263 [2025-03-16 15:15:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:13,144 INFO L225 Difference]: With dead ends: 18100 [2025-03-16 15:15:13,144 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:15:13,150 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:15:13,150 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 268 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:13,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 414 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:15:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:15:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0300629476883003) internal successors, (9491), 9214 states have internal predecessors, (9491), 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:15:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9491 transitions. [2025-03-16 15:15:13,211 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9491 transitions. Word has length 1263 [2025-03-16 15:15:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:13,212 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9491 transitions. [2025-03-16 15:15:13,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:15:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9491 transitions. [2025-03-16 15:15:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1362 [2025-03-16 15:15:13,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:13,225 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:15:13,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:15:13,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 350078172, now seen corresponding path program 1 times [2025-03-16 15:15:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870186583] [2025-03-16 15:15:13,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1361 statements into 1 equivalence classes. [2025-03-16 15:15:13,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1361 of 1361 statements. [2025-03-16 15:15:13,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:13,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3750 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 3527 trivial. 0 not checked. [2025-03-16 15:15:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870186583] [2025-03-16 15:15:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870186583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:13,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231855098] [2025-03-16 15:15:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:13,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:13,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:13,826 INFO L87 Difference]: Start difference. First operand 9215 states and 9491 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:15:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:14,393 INFO L93 Difference]: Finished difference Result 22377 states and 23088 transitions. [2025-03-16 15:15:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 1361 [2025-03-16 15:15:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:14,408 INFO L225 Difference]: With dead ends: 22377 [2025-03-16 15:15:14,408 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 15:15:14,417 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:15:14,418 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 304 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:14,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 416 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 15:15:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 12834. [2025-03-16 15:15:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.030312475648718) internal successors, (13222), 12833 states have internal predecessors, (13222), 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:15:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13222 transitions. [2025-03-16 15:15:14,524 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13222 transitions. Word has length 1361 [2025-03-16 15:15:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:14,525 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13222 transitions. [2025-03-16 15:15:14,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:15:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13222 transitions. [2025-03-16 15:15:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-03-16 15:15:14,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:14,596 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:15:14,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:14,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1323208126, now seen corresponding path program 1 times [2025-03-16 15:15:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:14,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146343430] [2025-03-16 15:15:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:14,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes. [2025-03-16 15:15:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1540 of 1540 statements. [2025-03-16 15:15:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4741 backedges. 3541 proven. 132 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2025-03-16 15:15:15,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146343430] [2025-03-16 15:15:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146343430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513837643] [2025-03-16 15:15:15,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:15,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:15,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:15,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:15:15,795 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:15:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes. [2025-03-16 15:15:16,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1540 of 1540 statements. [2025-03-16 15:15:16,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:16,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:16,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1799 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:15:16,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4741 backedges. 2086 proven. 201 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2025-03-16 15:15:18,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4741 backedges. 2086 proven. 201 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2025-03-16 15:15:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513837643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:15:21,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:15:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:15:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153114421] [2025-03-16 15:15:21,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:15:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:15:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:21,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:15:21,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:15:21,116 INFO L87 Difference]: Start difference. First operand 12834 states and 13222 transitions. Second operand has 9 states, 9 states have (on average 195.55555555555554) internal successors, (1760), 9 states have internal predecessors, (1760), 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:15:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:25,523 INFO L93 Difference]: Finished difference Result 38169 states and 39355 transitions. [2025-03-16 15:15:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:15:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 195.55555555555554) internal successors, (1760), 9 states have internal predecessors, (1760), 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 1540 [2025-03-16 15:15:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:25,548 INFO L225 Difference]: With dead ends: 38169 [2025-03-16 15:15:25,548 INFO L226 Difference]: Without dead ends: 25994 [2025-03-16 15:15:25,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3105 GetRequests, 3087 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-16 15:15:25,560 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3154 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8137 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 8137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:25,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3154 Valid, 97 Invalid, 8894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 8137 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:15:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25994 states. [2025-03-16 15:15:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25994 to 20401. [2025-03-16 15:15:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20401 states, 20400 states have (on average 1.028627450980392) internal successors, (20984), 20400 states have internal predecessors, (20984), 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:15:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 20984 transitions. [2025-03-16 15:15:25,739 INFO L78 Accepts]: Start accepts. Automaton has 20401 states and 20984 transitions. Word has length 1540 [2025-03-16 15:15:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 20401 states and 20984 transitions. [2025-03-16 15:15:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 195.55555555555554) internal successors, (1760), 9 states have internal predecessors, (1760), 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:15:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20401 states and 20984 transitions. [2025-03-16 15:15:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2025-03-16 15:15:25,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:25,762 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:25,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:15:25,962 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,SelfDestructingSolverStorable15 [2025-03-16 15:15:25,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1828627822, now seen corresponding path program 1 times [2025-03-16 15:15:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846749177] [2025-03-16 15:15:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:26,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1695 statements into 1 equivalence classes. [2025-03-16 15:15:26,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1695 of 1695 statements. [2025-03-16 15:15:26,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:26,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5896 backedges. 4532 proven. 41 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2025-03-16 15:15:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846749177] [2025-03-16 15:15:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846749177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560290859] [2025-03-16 15:15:27,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:27,880 INFO L229 MonitoredProcess]: Starting monitored process 4 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:15:27,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:15:28,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1695 statements into 1 equivalence classes. [2025-03-16 15:15:28,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1695 of 1695 statements. [2025-03-16 15:15:28,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:28,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:28,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:15:28,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5896 backedges. 3327 proven. 0 refuted. 0 times theorem prover too weak. 2569 trivial. 0 not checked. [2025-03-16 15:15:28,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560290859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:28,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:15:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507321262] [2025-03-16 15:15:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:28,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:28,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:28,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:28,539 INFO L87 Difference]: Start difference. First operand 20401 states and 20984 transitions. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:15:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:29,081 INFO L93 Difference]: Finished difference Result 40801 states and 41980 transitions. [2025-03-16 15:15:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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 1695 [2025-03-16 15:15:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:29,099 INFO L225 Difference]: With dead ends: 40801 [2025-03-16 15:15:29,099 INFO L226 Difference]: Without dead ends: 20401 [2025-03-16 15:15:29,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1699 GetRequests, 1695 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:29,112 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:29,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 430 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20401 states. [2025-03-16 15:15:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20401 to 20401. [2025-03-16 15:15:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20401 states, 20400 states have (on average 1.0282352941176471) internal successors, (20976), 20400 states have internal predecessors, (20976), 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:15:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 20976 transitions. [2025-03-16 15:15:29,270 INFO L78 Accepts]: Start accepts. Automaton has 20401 states and 20976 transitions. Word has length 1695 [2025-03-16 15:15:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 20401 states and 20976 transitions. [2025-03-16 15:15:29,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:15:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 20401 states and 20976 transitions. [2025-03-16 15:15:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1717 [2025-03-16 15:15:29,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:29,291 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:15:29,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:15:29,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:29,492 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2059208441, now seen corresponding path program 1 times [2025-03-16 15:15:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216668202] [2025-03-16 15:15:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:29,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1716 statements into 1 equivalence classes. [2025-03-16 15:15:29,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1716 of 1716 statements. [2025-03-16 15:15:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5701 backedges. 2918 proven. 505 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-16 15:15:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216668202] [2025-03-16 15:15:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216668202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550337700] [2025-03-16 15:15:32,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:32,781 INFO L229 MonitoredProcess]: Starting monitored process 5 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:15:32,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:15:32,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1716 statements into 1 equivalence classes. [2025-03-16 15:15:33,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1716 of 1716 statements. [2025-03-16 15:15:33,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:33,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:33,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1990 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:15:33,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5701 backedges. 3594 proven. 0 refuted. 0 times theorem prover too weak. 2107 trivial. 0 not checked. [2025-03-16 15:15:33,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:33,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550337700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:33,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:33,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 15:15:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629462963] [2025-03-16 15:15:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:33,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:33,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:33,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:15:33,234 INFO L87 Difference]: Start difference. First operand 20401 states and 20976 transitions. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:15:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:33,854 INFO L93 Difference]: Finished difference Result 41788 states and 43010 transitions. [2025-03-16 15:15:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:33,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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 1716 [2025-03-16 15:15:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:33,873 INFO L225 Difference]: With dead ends: 41788 [2025-03-16 15:15:33,873 INFO L226 Difference]: Without dead ends: 22046 [2025-03-16 15:15:33,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1724 GetRequests, 1718 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:15:33,887 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:33,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 430 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22046 states. [2025-03-16 15:15:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22046 to 21717. [2025-03-16 15:15:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21717 states, 21716 states have (on average 1.0279977896481858) internal successors, (22324), 21716 states have internal predecessors, (22324), 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:15:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21717 states to 21717 states and 22324 transitions. [2025-03-16 15:15:34,057 INFO L78 Accepts]: Start accepts. Automaton has 21717 states and 22324 transitions. Word has length 1716 [2025-03-16 15:15:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:34,057 INFO L471 AbstractCegarLoop]: Abstraction has 21717 states and 22324 transitions. [2025-03-16 15:15:34,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:15:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21717 states and 22324 transitions. [2025-03-16 15:15:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2025-03-16 15:15:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:34,079 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:34,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:15:34,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:15:34,280 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1741990487, now seen corresponding path program 1 times [2025-03-16 15:15:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700306247] [2025-03-16 15:15:34,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:34,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:15:34,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:15:34,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:34,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6001 backedges. 3043 proven. 523 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2025-03-16 15:15:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700306247] [2025-03-16 15:15:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700306247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864309890] [2025-03-16 15:15:37,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:37,316 INFO L229 MonitoredProcess]: Starting monitored process 6 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:15:37,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:15:37,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:15:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:15:37,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:37,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:37,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 2024 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:15:37,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6001 backedges. 3736 proven. 67 refuted. 0 times theorem prover too weak. 2198 trivial. 0 not checked. [2025-03-16 15:15:46,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6001 backedges. 2769 proven. 0 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2025-03-16 15:15:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864309890] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:15:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 10 [2025-03-16 15:15:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324482405] [2025-03-16 15:15:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:49,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:49,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:49,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:15:49,412 INFO L87 Difference]: Start difference. First operand 21717 states and 22324 transitions. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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:15:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:50,058 INFO L93 Difference]: Finished difference Result 43762 states and 44973 transitions. [2025-03-16 15:15:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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:15:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:50,079 INFO L225 Difference]: With dead ends: 43762 [2025-03-16 15:15:50,079 INFO L226 Difference]: Without dead ends: 22704 [2025-03-16 15:15:50,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3501 GetRequests, 3493 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:15:50,093 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 268 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:50,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 34 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22704 states. [2025-03-16 15:15:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22704 to 21717. [2025-03-16 15:15:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21717 states, 21716 states have (on average 1.0233928900349973) internal successors, (22224), 21716 states have internal predecessors, (22224), 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:15:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21717 states to 21717 states and 22224 transitions. [2025-03-16 15:15:50,260 INFO L78 Accepts]: Start accepts. Automaton has 21717 states and 22224 transitions. Word has length 1747 [2025-03-16 15:15:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:50,261 INFO L471 AbstractCegarLoop]: Abstraction has 21717 states and 22224 transitions. [2025-03-16 15:15:50,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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:15:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21717 states and 22224 transitions. [2025-03-16 15:15:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1798 [2025-03-16 15:15:50,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:50,282 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:15:50,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:50,487 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1595561389, now seen corresponding path program 1 times [2025-03-16 15:15:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:50,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973523229] [2025-03-16 15:15:50,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:50,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1797 statements into 1 equivalence classes. [2025-03-16 15:15:50,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1797 of 1797 statements. [2025-03-16 15:15:50,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6316 backedges. 2880 proven. 1608 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2025-03-16 15:15:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973523229] [2025-03-16 15:15:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973523229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408415928] [2025-03-16 15:15:54,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:54,457 INFO L229 MonitoredProcess]: Starting monitored process 7 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:15:54,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:15:54,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1797 statements into 1 equivalence classes. [2025-03-16 15:15:54,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1797 of 1797 statements. [2025-03-16 15:15:54,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:54,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:54,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 2076 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:15:54,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6316 backedges. 3385 proven. 250 refuted. 0 times theorem prover too weak. 2681 trivial. 0 not checked. [2025-03-16 15:15:55,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6316 backedges. 2495 proven. 0 refuted. 0 times theorem prover too weak. 3821 trivial. 0 not checked. [2025-03-16 15:15:56,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408415928] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:15:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 13 [2025-03-16 15:15:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133126677] [2025-03-16 15:15:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:56,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:56,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:15:56,661 INFO L87 Difference]: Start difference. First operand 21717 states and 22224 transitions. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:15:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:57,259 INFO L93 Difference]: Finished difference Result 43433 states and 44448 transitions. [2025-03-16 15:15:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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 1797 [2025-03-16 15:15:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:57,279 INFO L225 Difference]: With dead ends: 43433 [2025-03-16 15:15:57,279 INFO L226 Difference]: Without dead ends: 22046 [2025-03-16 15:15:57,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3603 GetRequests, 3592 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:15:57,291 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:57,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 16 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22046 states. [2025-03-16 15:15:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22046 to 19743. [2025-03-16 15:15:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19743 states, 19742 states have (on average 1.0220848951474015) internal successors, (20178), 19742 states have internal predecessors, (20178), 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:15:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19743 states to 19743 states and 20178 transitions. [2025-03-16 15:15:57,447 INFO L78 Accepts]: Start accepts. Automaton has 19743 states and 20178 transitions. Word has length 1797 [2025-03-16 15:15:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:57,447 INFO L471 AbstractCegarLoop]: Abstraction has 19743 states and 20178 transitions. [2025-03-16 15:15:57,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:15:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 19743 states and 20178 transitions. [2025-03-16 15:15:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1865 [2025-03-16 15:15:57,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:57,470 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:57,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 15:15:57,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:57,670 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:57,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1392069709, now seen corresponding path program 1 times [2025-03-16 15:15:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844570504] [2025-03-16 15:15:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:57,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1864 statements into 1 equivalence classes. [2025-03-16 15:15:57,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1864 of 1864 statements. [2025-03-16 15:15:57,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:57,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7013 backedges. 3147 proven. 1608 refuted. 0 times theorem prover too weak. 2258 trivial. 0 not checked. [2025-03-16 15:16:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844570504] [2025-03-16 15:16:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844570504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861103177] [2025-03-16 15:16:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:01,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:01,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:01,654 INFO L229 MonitoredProcess]: Starting monitored process 8 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:16:01,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:16:01,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1864 statements into 1 equivalence classes. [2025-03-16 15:16:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1864 of 1864 statements. [2025-03-16 15:16:01,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:01,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:16:01,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:16:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7013 backedges. 4045 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2025-03-16 15:16:02,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:16:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861103177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:16:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-03-16 15:16:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072674980] [2025-03-16 15:16:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:02,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:02,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:16:02,562 INFO L87 Difference]: Start difference. First operand 19743 states and 20178 transitions. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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:16:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:03,127 INFO L93 Difference]: Finished difference Result 40143 states and 41048 transitions. [2025-03-16 15:16:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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 1864 [2025-03-16 15:16:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:03,194 INFO L225 Difference]: With dead ends: 40143 [2025-03-16 15:16:03,194 INFO L226 Difference]: Without dead ends: 20730 [2025-03-16 15:16:03,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1874 GetRequests, 1865 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:16:03,200 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:03,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 91 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:16:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2025-03-16 15:16:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 20401. [2025-03-16 15:16:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20401 states, 20400 states have (on average 1.0223529411764707) internal successors, (20856), 20400 states have internal predecessors, (20856), 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:16:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 20856 transitions. [2025-03-16 15:16:03,424 INFO L78 Accepts]: Start accepts. Automaton has 20401 states and 20856 transitions. Word has length 1864 [2025-03-16 15:16:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:03,425 INFO L471 AbstractCegarLoop]: Abstraction has 20401 states and 20856 transitions. [2025-03-16 15:16:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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:16:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20401 states and 20856 transitions. [2025-03-16 15:16:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2028 [2025-03-16 15:16:03,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:03,473 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2025-03-16 15:16:03,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:16:03,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:03,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1552609359, now seen corresponding path program 1 times [2025-03-16 15:16:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581392047] [2025-03-16 15:16:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:03,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2027 statements into 1 equivalence classes. [2025-03-16 15:16:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2027 of 2027 statements. [2025-03-16 15:16:03,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7746 backedges. 3796 proven. 0 refuted. 0 times theorem prover too weak. 3950 trivial. 0 not checked. [2025-03-16 15:16:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581392047] [2025-03-16 15:16:05,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581392047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:05,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045062596] [2025-03-16 15:16:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:05,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:05,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:05,423 INFO L87 Difference]: Start difference. First operand 20401 states and 20856 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:16:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:06,058 INFO L93 Difference]: Finished difference Result 42446 states and 43382 transitions. [2025-03-16 15:16:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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 2027 [2025-03-16 15:16:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:06,077 INFO L225 Difference]: With dead ends: 42446 [2025-03-16 15:16:06,077 INFO L226 Difference]: Without dead ends: 22375 [2025-03-16 15:16:06,090 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:16:06,091 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:06,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 53 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:16:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22375 states. [2025-03-16 15:16:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22375 to 21059. [2025-03-16 15:16:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21059 states, 21058 states have (on average 1.021891917561022) internal successors, (21519), 21058 states have internal predecessors, (21519), 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:16:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21059 states to 21059 states and 21519 transitions. [2025-03-16 15:16:06,247 INFO L78 Accepts]: Start accepts. Automaton has 21059 states and 21519 transitions. Word has length 2027 [2025-03-16 15:16:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:06,247 INFO L471 AbstractCegarLoop]: Abstraction has 21059 states and 21519 transitions. [2025-03-16 15:16:06,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:16:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 21059 states and 21519 transitions. [2025-03-16 15:16:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2025-03-16 15:16:06,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:06,270 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:16:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:16:06,270 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1822063479, now seen corresponding path program 1 times [2025-03-16 15:16:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983246402] [2025-03-16 15:16:06,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:06,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2068 statements into 1 equivalence classes. [2025-03-16 15:16:06,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2068 of 2068 statements. [2025-03-16 15:16:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8496 backedges. 6307 proven. 91 refuted. 0 times theorem prover too weak. 2098 trivial. 0 not checked. [2025-03-16 15:16:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983246402] [2025-03-16 15:16:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983246402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587875539] [2025-03-16 15:16:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:08,244 INFO L229 MonitoredProcess]: Starting monitored process 9 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:16:08,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:16:08,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2068 statements into 1 equivalence classes. [2025-03-16 15:16:08,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2068 of 2068 statements. [2025-03-16 15:16:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:16:08,609 INFO L279 TraceCheckSpWp]: Computing forward predicates...