./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem17_label41.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 f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:11:09,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:11:09,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:11:09,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:11:09,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:11:09,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:11:09,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:11:09,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:11:09,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:11:09,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:11:09,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:11:09,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:11:09,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:11:09,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:11:09,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:11:09,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:11:09,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:11:09,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:11:09,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:11:09,889 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 -> f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e [2025-03-08 02:11:10,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:11:10,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:11:10,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:11:10,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:11:10,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:11:10,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-03-08 02:11:11,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b54e5b7/05aab5da7e3d4c99a52ad6f95d7b38c9/FLAG3be427301 [2025-03-08 02:11:11,718 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:11:11,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-03-08 02:11:11,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b54e5b7/05aab5da7e3d4c99a52ad6f95d7b38c9/FLAG3be427301 [2025-03-08 02:11:11,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b54e5b7/05aab5da7e3d4c99a52ad6f95d7b38c9 [2025-03-08 02:11:11,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:11:11,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:11:11,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:11:11,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:11:11,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:11:11,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:11:11" (1/1) ... [2025-03-08 02:11:11,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76735cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:11, skipping insertion in model container [2025-03-08 02:11:11,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:11:11" (1/1) ... [2025-03-08 02:11:11,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:11:12,084 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/Problem17_label41.c[5202,5215] [2025-03-08 02:11:12,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:11:12,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:11:12,440 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/Problem17_label41.c[5202,5215] [2025-03-08 02:11:12,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:11:12,666 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:11:12,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12 WrapperNode [2025-03-08 02:11:12,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:11:12,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:11:12,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:11:12,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:11:12,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:12,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:12,918 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:11:12,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:11:12,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:11:12,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:11:12,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:11:12,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:12,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:12,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,090 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-08 02:11:13,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:11:13,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:11:13,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:11:13,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:11:13,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (1/1) ... [2025-03-08 02:11:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:11:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:13,249 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-08 02:11:13,255 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-08 02:11:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:11:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:11:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:11:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:11:13,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:11:13,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:11:15,618 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:11:15,711 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:11:15,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:11:15,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:11:15,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:11:15,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:11:15 BoogieIcfgContainer [2025-03-08 02:11:15,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:11:15,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:11:15,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:11:15,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:11:15,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:11:11" (1/3) ... [2025-03-08 02:11:15,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6424f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:11:15, skipping insertion in model container [2025-03-08 02:11:15,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:11:12" (2/3) ... [2025-03-08 02:11:15,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6424f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:11:15, skipping insertion in model container [2025-03-08 02:11:15,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:11:15" (3/3) ... [2025-03-08 02:11:15,746 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2025-03-08 02:11:15,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:11:15,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label41.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:11:15,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:11:15,836 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;@2fb00353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:11:15,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:11:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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-08 02:11:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 02:11:15,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:15,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:15,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:15,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1728760468, now seen corresponding path program 1 times [2025-03-08 02:11:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528191507] [2025-03-08 02:11:15,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:15,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 02:11:15,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 02:11:15,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:15,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:16,091 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-08 02:11:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528191507] [2025-03-08 02:11:16,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528191507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:16,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:16,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:11:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404400689] [2025-03-08 02:11:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:16,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:16,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:16,115 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 02:11:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:18,040 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-08 02:11:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-08 02:11:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:18,053 INFO L225 Difference]: With dead ends: 1667 [2025-03-08 02:11:18,053 INFO L226 Difference]: Without dead ends: 998 [2025-03-08 02:11:18,057 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-08 02:11:18,058 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 511 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:18,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-08 02:11:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-08 02:11:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 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-08 02:11:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-08 02:11:18,122 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 34 [2025-03-08 02:11:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:18,122 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-08 02:11:18,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 02:11:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-08 02:11:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 02:11:18,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:18,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:18,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:11:18,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1733764571, now seen corresponding path program 1 times [2025-03-08 02:11:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926902329] [2025-03-08 02:11:18,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 02:11:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 02:11:18,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:18,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926902329] [2025-03-08 02:11:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926902329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:11:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928283421] [2025-03-08 02:11:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:18,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:18,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:18,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:18,384 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-08 02:11:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:20,037 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-08 02:11:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-08 02:11:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:20,044 INFO L225 Difference]: With dead ends: 2824 [2025-03-08 02:11:20,044 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:11:20,047 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-08 02:11:20,047 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:20,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:11:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:11:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-08 02:11:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 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-08 02:11:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-08 02:11:20,086 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 99 [2025-03-08 02:11:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:20,086 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-08 02:11:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-08 02:11:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-08 02:11:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 02:11:20,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:20,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:20,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:11:20,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -534783869, now seen corresponding path program 1 times [2025-03-08 02:11:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801610140] [2025-03-08 02:11:20,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 02:11:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 02:11:20,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801610140] [2025-03-08 02:11:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801610140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640472677] [2025-03-08 02:11:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:20,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:20,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:20,375 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-08 02:11:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:21,914 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-08 02:11:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-08 02:11:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:21,923 INFO L225 Difference]: With dead ends: 4546 [2025-03-08 02:11:21,923 INFO L226 Difference]: Without dead ends: 2704 [2025-03-08 02:11:21,925 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-08 02:11:21,926 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:21,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:11:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-08 02:11:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-08 02:11:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 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-08 02:11:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-08 02:11:21,963 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 182 [2025-03-08 02:11:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-08 02:11:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-08 02:11:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-08 02:11:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 02:11:21,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:21,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:11:21,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1211015788, now seen corresponding path program 1 times [2025-03-08 02:11:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204330862] [2025-03-08 02:11:21,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:22,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 02:11:22,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 02:11:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:11:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204330862] [2025-03-08 02:11:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204330862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791969616] [2025-03-08 02:11:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:22,118 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 02:11:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:23,563 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-03-08 02:11:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 188 [2025-03-08 02:11:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:23,576 INFO L225 Difference]: With dead ends: 7954 [2025-03-08 02:11:23,576 INFO L226 Difference]: Without dead ends: 5252 [2025-03-08 02:11:23,580 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-08 02:11:23,580 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 414 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:23,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:11:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-03-08 02:11:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-03-08 02:11:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 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-08 02:11:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-03-08 02:11:23,639 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 188 [2025-03-08 02:11:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:23,640 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-03-08 02:11:23,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 02:11:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-03-08 02:11:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 02:11:23,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:23,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:11:23,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 349453486, now seen corresponding path program 1 times [2025-03-08 02:11:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111040597] [2025-03-08 02:11:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:23,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 02:11:23,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 02:11:23,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:23,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:23,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111040597] [2025-03-08 02:11:23,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111040597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585139865] [2025-03-08 02:11:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:23,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:23,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:23,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:23,849 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-08 02:11:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:25,358 INFO L93 Difference]: Finished difference Result 13930 states and 17666 transitions. [2025-03-08 02:11:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:25,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-03-08 02:11:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:25,378 INFO L225 Difference]: With dead ends: 13930 [2025-03-08 02:11:25,378 INFO L226 Difference]: Without dead ends: 7828 [2025-03-08 02:11:25,383 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-08 02:11:25,385 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 418 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:25,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 953 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:11:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7828 states. [2025-03-08 02:11:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7828 to 7822. [2025-03-08 02:11:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 1.1792609640710907) internal successors, (9223), 7821 states have internal predecessors, (9223), 0 states have call successors, (0), 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-08 02:11:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 9223 transitions. [2025-03-08 02:11:25,475 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 9223 transitions. Word has length 201 [2025-03-08 02:11:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:25,475 INFO L471 AbstractCegarLoop]: Abstraction has 7822 states and 9223 transitions. [2025-03-08 02:11:25,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-08 02:11:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 9223 transitions. [2025-03-08 02:11:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 02:11:25,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:25,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:11:25,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -330951268, now seen corresponding path program 1 times [2025-03-08 02:11:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956221056] [2025-03-08 02:11:25,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:25,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 02:11:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 02:11:25,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:25,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:11:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956221056] [2025-03-08 02:11:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956221056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357020699] [2025-03-08 02:11:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:25,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:25,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:25,673 INFO L87 Difference]: Start difference. First operand 7822 states and 9223 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 02:11:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:27,021 INFO L93 Difference]: Finished difference Result 16499 states and 19469 transitions. [2025-03-08 02:11:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 254 [2025-03-08 02:11:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:27,039 INFO L225 Difference]: With dead ends: 16499 [2025-03-08 02:11:27,039 INFO L226 Difference]: Without dead ends: 8679 [2025-03-08 02:11:27,045 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-08 02:11:27,046 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 402 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 934 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8679 states. [2025-03-08 02:11:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8679 to 8249. [2025-03-08 02:11:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8249 states, 8248 states have (on average 1.1793161978661493) internal successors, (9727), 8248 states have internal predecessors, (9727), 0 states have call successors, (0), 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-08 02:11:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8249 states to 8249 states and 9727 transitions. [2025-03-08 02:11:27,180 INFO L78 Accepts]: Start accepts. Automaton has 8249 states and 9727 transitions. Word has length 254 [2025-03-08 02:11:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:27,180 INFO L471 AbstractCegarLoop]: Abstraction has 8249 states and 9727 transitions. [2025-03-08 02:11:27,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 02:11:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8249 states and 9727 transitions. [2025-03-08 02:11:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 02:11:27,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:27,185 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:27,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:11:27,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:27,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -987339364, now seen corresponding path program 1 times [2025-03-08 02:11:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140441923] [2025-03-08 02:11:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:27,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 02:11:27,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 02:11:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 02:11:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140441923] [2025-03-08 02:11:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140441923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230212760] [2025-03-08 02:11:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:27,459 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-08 02:11:27,460 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-08 02:11:27,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 02:11:27,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 02:11:27,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:27,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:27,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:11:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 02:11:27,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 02:11:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230212760] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:11:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:11:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464792450] [2025-03-08 02:11:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:27,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:27,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:27,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:11:27,978 INFO L87 Difference]: Start difference. First operand 8249 states and 9727 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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-08 02:11:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:30,117 INFO L93 Difference]: Finished difference Result 28026 states and 33258 transitions. [2025-03-08 02:11:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 258 [2025-03-08 02:11:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:30,147 INFO L225 Difference]: With dead ends: 28026 [2025-03-08 02:11:30,147 INFO L226 Difference]: Without dead ends: 18923 [2025-03-08 02:11:30,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:11:30,156 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 891 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:30,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 161 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:11:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18923 states. [2025-03-08 02:11:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18923 to 18921. [2025-03-08 02:11:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18921 states, 18920 states have (on average 1.1585623678646935) internal successors, (21920), 18920 states have internal predecessors, (21920), 0 states have call successors, (0), 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-08 02:11:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 21920 transitions. [2025-03-08 02:11:30,320 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 21920 transitions. Word has length 258 [2025-03-08 02:11:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 18921 states and 21920 transitions. [2025-03-08 02:11:30,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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-08 02:11:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 21920 transitions. [2025-03-08 02:11:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 02:11:30,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:30,324 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:30,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:11:30,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:30,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 931948438, now seen corresponding path program 1 times [2025-03-08 02:11:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:30,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890795627] [2025-03-08 02:11:30,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 02:11:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 02:11:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:11:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:30,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890795627] [2025-03-08 02:11:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890795627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:30,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783630236] [2025-03-08 02:11:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:30,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:30,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:30,663 INFO L87 Difference]: Start difference. First operand 18921 states and 21920 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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-08 02:11:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:31,960 INFO L93 Difference]: Finished difference Result 41242 states and 47867 transitions. [2025-03-08 02:11:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 271 [2025-03-08 02:11:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:31,997 INFO L225 Difference]: With dead ends: 41242 [2025-03-08 02:11:31,997 INFO L226 Difference]: Without dead ends: 21897 [2025-03-08 02:11:32,008 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-08 02:11:32,009 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 384 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:32,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 842 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21897 states. [2025-03-08 02:11:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21897 to 21897. [2025-03-08 02:11:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21897 states, 21896 states have (on average 1.140938984289368) internal successors, (24982), 21896 states have internal predecessors, (24982), 0 states have call successors, (0), 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-08 02:11:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21897 states to 21897 states and 24982 transitions. [2025-03-08 02:11:32,197 INFO L78 Accepts]: Start accepts. Automaton has 21897 states and 24982 transitions. Word has length 271 [2025-03-08 02:11:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:32,197 INFO L471 AbstractCegarLoop]: Abstraction has 21897 states and 24982 transitions. [2025-03-08 02:11:32,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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-08 02:11:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21897 states and 24982 transitions. [2025-03-08 02:11:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 02:11:32,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:32,201 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:32,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:11:32,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1584598470, now seen corresponding path program 1 times [2025-03-08 02:11:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952540846] [2025-03-08 02:11:32,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:32,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 02:11:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 02:11:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:11:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952540846] [2025-03-08 02:11:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952540846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412304162] [2025-03-08 02:11:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:32,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:32,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:32,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:32,386 INFO L87 Difference]: Start difference. First operand 21897 states and 24982 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-08 02:11:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:33,771 INFO L93 Difference]: Finished difference Result 53201 states and 60828 transitions. [2025-03-08 02:11:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 306 [2025-03-08 02:11:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:33,803 INFO L225 Difference]: With dead ends: 53201 [2025-03-08 02:11:33,804 INFO L226 Difference]: Without dead ends: 30878 [2025-03-08 02:11:33,820 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-08 02:11:33,821 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 466 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:33,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 326 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30878 states. [2025-03-08 02:11:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30878 to 21894. [2025-03-08 02:11:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21894 states, 21893 states have (on average 1.139816379664733) internal successors, (24954), 21893 states have internal predecessors, (24954), 0 states have call successors, (0), 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-08 02:11:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21894 states to 21894 states and 24954 transitions. [2025-03-08 02:11:34,026 INFO L78 Accepts]: Start accepts. Automaton has 21894 states and 24954 transitions. Word has length 306 [2025-03-08 02:11:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 21894 states and 24954 transitions. [2025-03-08 02:11:34,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-08 02:11:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21894 states and 24954 transitions. [2025-03-08 02:11:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-08 02:11:34,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:34,031 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:34,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:11:34,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:34,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1462150750, now seen corresponding path program 1 times [2025-03-08 02:11:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966403972] [2025-03-08 02:11:34,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-08 02:11:34,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-08 02:11:34,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 343 proven. 73 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 02:11:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966403972] [2025-03-08 02:11:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966403972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053273603] [2025-03-08 02:11:34,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:34,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:34,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:34,320 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-08 02:11:34,321 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-08 02:11:34,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-08 02:11:34,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-08 02:11:34,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:34,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:34,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:11:34,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 343 proven. 73 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 02:11:34,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 02:11:34,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053273603] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:11:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:11:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559646247] [2025-03-08 02:11:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:34,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:34,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:34,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:11:34,823 INFO L87 Difference]: Start difference. First operand 21894 states and 24954 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-08 02:11:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:36,862 INFO L93 Difference]: Finished difference Result 56162 states and 64116 transitions. [2025-03-08 02:11:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 332 [2025-03-08 02:11:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:36,896 INFO L225 Difference]: With dead ends: 56162 [2025-03-08 02:11:36,896 INFO L226 Difference]: Without dead ends: 33843 [2025-03-08 02:11:36,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:11:36,914 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 856 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:36,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 205 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:11:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33843 states. [2025-03-08 02:11:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33843 to 31715. [2025-03-08 02:11:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31715 states, 31714 states have (on average 1.1472851106766728) internal successors, (36385), 31714 states have internal predecessors, (36385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31715 states to 31715 states and 36385 transitions. [2025-03-08 02:11:37,291 INFO L78 Accepts]: Start accepts. Automaton has 31715 states and 36385 transitions. Word has length 332 [2025-03-08 02:11:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:37,291 INFO L471 AbstractCegarLoop]: Abstraction has 31715 states and 36385 transitions. [2025-03-08 02:11:37,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-08 02:11:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31715 states and 36385 transitions. [2025-03-08 02:11:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-08 02:11:37,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:37,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-08 02:11:37,302 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-08 02:11:37,500 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,SelfDestructingSolverStorable9 [2025-03-08 02:11:37,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1715314933, now seen corresponding path program 1 times [2025-03-08 02:11:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066043639] [2025-03-08 02:11:37,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 02:11:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 02:11:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:11:37,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:37,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066043639] [2025-03-08 02:11:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066043639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423298909] [2025-03-08 02:11:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:37,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:37,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:37,659 INFO L87 Difference]: Start difference. First operand 31715 states and 36385 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-08 02:11:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:38,963 INFO L93 Difference]: Finished difference Result 68124 states and 78158 transitions. [2025-03-08 02:11:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:38,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 346 [2025-03-08 02:11:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:38,999 INFO L225 Difference]: With dead ends: 68124 [2025-03-08 02:11:38,999 INFO L226 Difference]: Without dead ends: 35980 [2025-03-08 02:11:39,021 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-08 02:11:39,022 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 442 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:39,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 833 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:11:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35980 states. [2025-03-08 02:11:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35980 to 33848. [2025-03-08 02:11:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33848 states, 33847 states have (on average 1.1451827340680119) internal successors, (38761), 33847 states have internal predecessors, (38761), 0 states have call successors, (0), 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-08 02:11:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33848 states to 33848 states and 38761 transitions. [2025-03-08 02:11:39,394 INFO L78 Accepts]: Start accepts. Automaton has 33848 states and 38761 transitions. Word has length 346 [2025-03-08 02:11:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:39,394 INFO L471 AbstractCegarLoop]: Abstraction has 33848 states and 38761 transitions. [2025-03-08 02:11:39,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-08 02:11:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33848 states and 38761 transitions. [2025-03-08 02:11:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 02:11:39,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:39,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:39,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:11:39,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:39,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1884966474, now seen corresponding path program 1 times [2025-03-08 02:11:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248775438] [2025-03-08 02:11:39,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:39,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 02:11:39,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 02:11:39,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:39,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:11:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248775438] [2025-03-08 02:11:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248775438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809827197] [2025-03-08 02:11:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:39,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:39,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:39,560 INFO L87 Difference]: Start difference. First operand 33848 states and 38761 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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-08 02:11:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:40,759 INFO L93 Difference]: Finished difference Result 71950 states and 82485 transitions. [2025-03-08 02:11:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 377 [2025-03-08 02:11:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:40,793 INFO L225 Difference]: With dead ends: 71950 [2025-03-08 02:11:40,793 INFO L226 Difference]: Without dead ends: 37679 [2025-03-08 02:11:40,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:40,812 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:40,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 879 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37679 states. [2025-03-08 02:11:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37679 to 37677. [2025-03-08 02:11:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37677 states, 37676 states have (on average 1.1356301093534344) internal successors, (42786), 37676 states have internal predecessors, (42786), 0 states have call successors, (0), 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-08 02:11:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37677 states to 37677 states and 42786 transitions. [2025-03-08 02:11:41,162 INFO L78 Accepts]: Start accepts. Automaton has 37677 states and 42786 transitions. Word has length 377 [2025-03-08 02:11:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 37677 states and 42786 transitions. [2025-03-08 02:11:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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-08 02:11:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 37677 states and 42786 transitions. [2025-03-08 02:11:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-08 02:11:41,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:41,167 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:11:41,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 256967293, now seen corresponding path program 1 times [2025-03-08 02:11:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312999680] [2025-03-08 02:11:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:41,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-08 02:11:41,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-08 02:11:41,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:41,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:11:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312999680] [2025-03-08 02:11:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312999680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166864775] [2025-03-08 02:11:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:41,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:41,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:41,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:41,649 INFO L87 Difference]: Start difference. First operand 37677 states and 42786 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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-08 02:11:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:43,624 INFO L93 Difference]: Finished difference Result 87315 states and 99224 transitions. [2025-03-08 02:11:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 416 [2025-03-08 02:11:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:43,683 INFO L225 Difference]: With dead ends: 87315 [2025-03-08 02:11:43,684 INFO L226 Difference]: Without dead ends: 49206 [2025-03-08 02:11:43,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:43,711 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 753 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:43,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 803 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:11:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2025-03-08 02:11:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 43221. [2025-03-08 02:11:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43221 states, 43220 states have (on average 1.1329939842665433) internal successors, (48968), 43220 states have internal predecessors, (48968), 0 states have call successors, (0), 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-08 02:11:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43221 states to 43221 states and 48968 transitions. [2025-03-08 02:11:44,089 INFO L78 Accepts]: Start accepts. Automaton has 43221 states and 48968 transitions. Word has length 416 [2025-03-08 02:11:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 43221 states and 48968 transitions. [2025-03-08 02:11:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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-08 02:11:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 43221 states and 48968 transitions. [2025-03-08 02:11:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 02:11:44,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:44,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:44,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:11:44,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:44,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:44,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1875219563, now seen corresponding path program 1 times [2025-03-08 02:11:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:44,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832626082] [2025-03-08 02:11:44,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:44,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 02:11:44,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 02:11:44,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:44,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 02:11:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832626082] [2025-03-08 02:11:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832626082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387577364] [2025-03-08 02:11:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:44,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:44,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:44,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:44,300 INFO L87 Difference]: Start difference. First operand 43221 states and 48968 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-08 02:11:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:45,695 INFO L93 Difference]: Finished difference Result 94956 states and 106816 transitions. [2025-03-08 02:11:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 457 [2025-03-08 02:11:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:45,748 INFO L225 Difference]: With dead ends: 94956 [2025-03-08 02:11:45,748 INFO L226 Difference]: Without dead ends: 51312 [2025-03-08 02:11:45,777 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-08 02:11:45,777 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 491 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:45,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 281 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51312 states. [2025-03-08 02:11:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51312 to 41909. [2025-03-08 02:11:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41909 states, 41908 states have (on average 1.1245585568387897) internal successors, (47128), 41908 states have internal predecessors, (47128), 0 states have call successors, (0), 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-08 02:11:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41909 states to 41909 states and 47128 transitions. [2025-03-08 02:11:46,145 INFO L78 Accepts]: Start accepts. Automaton has 41909 states and 47128 transitions. Word has length 457 [2025-03-08 02:11:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 41909 states and 47128 transitions. [2025-03-08 02:11:46,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-08 02:11:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41909 states and 47128 transitions. [2025-03-08 02:11:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 02:11:46,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:46,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:11:46,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -431017673, now seen corresponding path program 1 times [2025-03-08 02:11:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468489508] [2025-03-08 02:11:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:46,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 02:11:46,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 02:11:46,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:46,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 332 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:46,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:46,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468489508] [2025-03-08 02:11:46,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468489508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:46,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795687108] [2025-03-08 02:11:46,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:46,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:46,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:46,662 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-08 02:11:46,662 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-08 02:11:46,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 02:11:46,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 02:11:46,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:46,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:11:46,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 02:11:47,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 02:11:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795687108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:11:47,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:11:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:11:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464175584] [2025-03-08 02:11:47,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:11:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:11:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:11:47,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:11:47,664 INFO L87 Difference]: Start difference. First operand 41909 states and 47128 transitions. Second operand has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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-08 02:11:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:57,125 INFO L93 Difference]: Finished difference Result 139202 states and 157831 transitions. [2025-03-08 02:11:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 02:11:57,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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 469 [2025-03-08 02:11:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:57,226 INFO L225 Difference]: With dead ends: 139202 [2025-03-08 02:11:57,226 INFO L226 Difference]: Without dead ends: 94743 [2025-03-08 02:11:57,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-03-08 02:11:57,254 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 6435 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 13903 mSolverCounterSat, 2555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6435 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 16458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2555 IncrementalHoareTripleChecker+Valid, 13903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:57,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6435 Valid, 513 Invalid, 16458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2555 Valid, 13903 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-08 02:11:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94743 states. [2025-03-08 02:11:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94743 to 82768. [2025-03-08 02:11:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82768 states, 82767 states have (on average 1.127430014377711) internal successors, (93314), 82767 states have internal predecessors, (93314), 0 states have call successors, (0), 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-08 02:11:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82768 states to 82768 states and 93314 transitions. [2025-03-08 02:11:58,159 INFO L78 Accepts]: Start accepts. Automaton has 82768 states and 93314 transitions. Word has length 469 [2025-03-08 02:11:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:58,159 INFO L471 AbstractCegarLoop]: Abstraction has 82768 states and 93314 transitions. [2025-03-08 02:11:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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-08 02:11:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 82768 states and 93314 transitions. [2025-03-08 02:11:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 02:11:58,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:58,165 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:58,171 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-08 02:11:58,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:58,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:58,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:58,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1401590326, now seen corresponding path program 1 times [2025-03-08 02:11:58,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:58,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676039425] [2025-03-08 02:11:58,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:58,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 02:11:58,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 02:11:58,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:58,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-08 02:11:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676039425] [2025-03-08 02:11:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676039425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:58,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:58,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406593507] [2025-03-08 02:11:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:58,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:58,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:58,572 INFO L87 Difference]: Start difference. First operand 82768 states and 93314 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-08 02:12:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:00,082 INFO L93 Difference]: Finished difference Result 184678 states and 207928 transitions. [2025-03-08 02:12:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 478 [2025-03-08 02:12:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:00,177 INFO L225 Difference]: With dead ends: 184678 [2025-03-08 02:12:00,177 INFO L226 Difference]: Without dead ends: 98085 [2025-03-08 02:12:00,231 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-08 02:12:00,232 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 425 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:00,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 823 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:12:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98085 states. [2025-03-08 02:12:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98085 to 85292. [2025-03-08 02:12:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85292 states, 85291 states have (on average 1.113106892872636) internal successors, (94938), 85291 states have internal predecessors, (94938), 0 states have call successors, (0), 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-08 02:12:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85292 states to 85292 states and 94938 transitions. [2025-03-08 02:12:01,087 INFO L78 Accepts]: Start accepts. Automaton has 85292 states and 94938 transitions. Word has length 478 [2025-03-08 02:12:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:01,087 INFO L471 AbstractCegarLoop]: Abstraction has 85292 states and 94938 transitions. [2025-03-08 02:12:01,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-08 02:12:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 85292 states and 94938 transitions. [2025-03-08 02:12:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-08 02:12:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:01,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:12:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:12:01,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:01,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -805672076, now seen corresponding path program 1 times [2025-03-08 02:12:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:01,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796297803] [2025-03-08 02:12:01,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:01,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 02:12:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 02:12:01,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:01,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 02:12:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796297803] [2025-03-08 02:12:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796297803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:12:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109771040] [2025-03-08 02:12:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:12:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:12:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:01,420 INFO L87 Difference]: Start difference. First operand 85292 states and 94938 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-08 02:12:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:02,847 INFO L93 Difference]: Finished difference Result 176069 states and 195153 transitions. [2025-03-08 02:12:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 503 [2025-03-08 02:12:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:02,947 INFO L225 Difference]: With dead ends: 176069 [2025-03-08 02:12:02,947 INFO L226 Difference]: Without dead ends: 88647 [2025-03-08 02:12:03,001 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-08 02:12:03,001 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 442 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:03,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 561 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:12:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88647 states. [2025-03-08 02:12:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88647 to 86087. [2025-03-08 02:12:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86087 states, 86086 states have (on average 1.0954510605673395) internal successors, (94303), 86086 states have internal predecessors, (94303), 0 states have call successors, (0), 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-08 02:12:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86087 states to 86087 states and 94303 transitions. [2025-03-08 02:12:04,108 INFO L78 Accepts]: Start accepts. Automaton has 86087 states and 94303 transitions. Word has length 503 [2025-03-08 02:12:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:04,108 INFO L471 AbstractCegarLoop]: Abstraction has 86087 states and 94303 transitions. [2025-03-08 02:12:04,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-08 02:12:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 86087 states and 94303 transitions. [2025-03-08 02:12:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-08 02:12:04,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:04,116 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:12:04,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:12:04,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:04,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash -345460353, now seen corresponding path program 1 times [2025-03-08 02:12:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259510540] [2025-03-08 02:12:04,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:04,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-08 02:12:04,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-08 02:12:04,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:04,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:12:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259510540] [2025-03-08 02:12:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259510540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:12:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907840395] [2025-03-08 02:12:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:12:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:12:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:04,674 INFO L87 Difference]: Start difference. First operand 86087 states and 94303 transitions. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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-08 02:12:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:06,822 INFO L93 Difference]: Finished difference Result 188808 states and 207627 transitions. [2025-03-08 02:12:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:12:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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 512 [2025-03-08 02:12:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:06,958 INFO L225 Difference]: With dead ends: 188808 [2025-03-08 02:12:06,958 INFO L226 Difference]: Without dead ends: 102716 [2025-03-08 02:12:07,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:07,020 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 920 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:07,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 684 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:12:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102716 states. [2025-03-08 02:12:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102716 to 102260. [2025-03-08 02:12:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102260 states, 102259 states have (on average 1.0968521108166518) internal successors, (112163), 102259 states have internal predecessors, (112163), 0 states have call successors, (0), 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-08 02:12:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102260 states to 102260 states and 112163 transitions. [2025-03-08 02:12:08,411 INFO L78 Accepts]: Start accepts. Automaton has 102260 states and 112163 transitions. Word has length 512 [2025-03-08 02:12:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 102260 states and 112163 transitions. [2025-03-08 02:12:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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-08 02:12:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 102260 states and 112163 transitions. [2025-03-08 02:12:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 02:12:08,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:08,420 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:12:08,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:12:08,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:08,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash 424981159, now seen corresponding path program 1 times [2025-03-08 02:12:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81051568] [2025-03-08 02:12:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:08,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 02:12:08,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 02:12:08,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:08,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:12:08,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81051568] [2025-03-08 02:12:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81051568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:08,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:08,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:12:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085124310] [2025-03-08 02:12:08,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:12:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:12:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:08,743 INFO L87 Difference]: Start difference. First operand 102260 states and 112163 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-08 02:12:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:10,957 INFO L93 Difference]: Finished difference Result 229221 states and 250740 transitions. [2025-03-08 02:12:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:12:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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 522 [2025-03-08 02:12:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:11,114 INFO L225 Difference]: With dead ends: 229221 [2025-03-08 02:12:11,115 INFO L226 Difference]: Without dead ends: 126113 [2025-03-08 02:12:11,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:11,183 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 755 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:11,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 202 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:12:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126113 states. [2025-03-08 02:12:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126113 to 120582. [2025-03-08 02:12:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120582 states, 120581 states have (on average 1.0914903674708287) internal successors, (131613), 120581 states have internal predecessors, (131613), 0 states have call successors, (0), 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-08 02:12:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120582 states to 120582 states and 131613 transitions. [2025-03-08 02:12:12,638 INFO L78 Accepts]: Start accepts. Automaton has 120582 states and 131613 transitions. Word has length 522 [2025-03-08 02:12:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 120582 states and 131613 transitions. [2025-03-08 02:12:12,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-08 02:12:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 120582 states and 131613 transitions. [2025-03-08 02:12:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 02:12:12,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:12,648 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:12:12,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:12:12,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:12,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1855940881, now seen corresponding path program 1 times [2025-03-08 02:12:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944714761] [2025-03-08 02:12:12,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:12,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 02:12:12,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 02:12:12,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:12,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-08 02:12:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944714761] [2025-03-08 02:12:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944714761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:12:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950904741] [2025-03-08 02:12:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:12:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:13,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:12:13,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:13,128 INFO L87 Difference]: Start difference. First operand 120582 states and 131613 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-08 02:12:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:15,344 INFO L93 Difference]: Finished difference Result 263302 states and 286778 transitions. [2025-03-08 02:12:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:12:15,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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 527 [2025-03-08 02:12:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:15,485 INFO L225 Difference]: With dead ends: 263302 [2025-03-08 02:12:15,485 INFO L226 Difference]: Without dead ends: 141447 [2025-03-08 02:12:15,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:12:15,551 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 756 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:15,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 169 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:12:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141447 states. [2025-03-08 02:12:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141447 to 120582. [2025-03-08 02:12:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120582 states, 120581 states have (on average 1.0914654879292758) internal successors, (131610), 120581 states have internal predecessors, (131610), 0 states have call successors, (0), 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-08 02:12:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120582 states to 120582 states and 131610 transitions. [2025-03-08 02:12:17,203 INFO L78 Accepts]: Start accepts. Automaton has 120582 states and 131610 transitions. Word has length 527 [2025-03-08 02:12:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 120582 states and 131610 transitions. [2025-03-08 02:12:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-08 02:12:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 120582 states and 131610 transitions. [2025-03-08 02:12:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-08 02:12:17,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:17,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:12:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:12:17,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:17,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -812785854, now seen corresponding path program 1 times [2025-03-08 02:12:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222121847] [2025-03-08 02:12:17,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:17,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 02:12:17,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 02:12:17,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:17,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:12:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222121847] [2025-03-08 02:12:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222121847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:17,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:17,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:12:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803760009] [2025-03-08 02:12:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:17,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:12:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:17,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:12:18,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:18,000 INFO L87 Difference]: Start difference. First operand 120582 states and 131610 transitions. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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-08 02:12:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:19,083 INFO L93 Difference]: Finished difference Result 120584 states and 131611 transitions. [2025-03-08 02:12:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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 601 [2025-03-08 02:12:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:19,195 INFO L225 Difference]: With dead ends: 120584 [2025-03-08 02:12:19,195 INFO L226 Difference]: Without dead ends: 120582 [2025-03-08 02:12:19,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:19,221 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 575 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:19,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 537 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:12:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120582 states. [2025-03-08 02:12:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120582 to 120582. [2025-03-08 02:12:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120582 states, 120581 states have (on average 1.0914489015682405) internal successors, (131608), 120581 states have internal predecessors, (131608), 0 states have call successors, (0), 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-08 02:12:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120582 states to 120582 states and 131608 transitions. [2025-03-08 02:12:20,985 INFO L78 Accepts]: Start accepts. Automaton has 120582 states and 131608 transitions. Word has length 601 [2025-03-08 02:12:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:20,985 INFO L471 AbstractCegarLoop]: Abstraction has 120582 states and 131608 transitions. [2025-03-08 02:12:20,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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-08 02:12:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 120582 states and 131608 transitions. [2025-03-08 02:12:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 02:12:20,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:20,998 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:12:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:12:20,998 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1807012921, now seen corresponding path program 1 times [2025-03-08 02:12:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526497255] [2025-03-08 02:12:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:21,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 02:12:21,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 02:12:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:12:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:21,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526497255] [2025-03-08 02:12:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526497255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:12:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047691346] [2025-03-08 02:12:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:21,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:12:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:21,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:12:21,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:21,288 INFO L87 Difference]: Start difference. First operand 120582 states and 131608 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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-08 02:12:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:22,835 INFO L93 Difference]: Finished difference Result 250951 states and 273909 transitions. [2025-03-08 02:12:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:22,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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 603 [2025-03-08 02:12:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:22,970 INFO L225 Difference]: With dead ends: 250951 [2025-03-08 02:12:22,971 INFO L226 Difference]: Without dead ends: 130371 [2025-03-08 02:12:23,038 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-08 02:12:23,039 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 230 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:23,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 291 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:12:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130371 states. [2025-03-08 02:12:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130371 to 128657. [2025-03-08 02:12:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128657 states, 128656 states have (on average 1.0877067528914315) internal successors, (139940), 128656 states have internal predecessors, (139940), 0 states have call successors, (0), 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-08 02:12:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128657 states to 128657 states and 139940 transitions. [2025-03-08 02:12:24,460 INFO L78 Accepts]: Start accepts. Automaton has 128657 states and 139940 transitions. Word has length 603 [2025-03-08 02:12:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:24,460 INFO L471 AbstractCegarLoop]: Abstraction has 128657 states and 139940 transitions. [2025-03-08 02:12:24,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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-08 02:12:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 128657 states and 139940 transitions. [2025-03-08 02:12:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-08 02:12:24,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:24,478 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:12:24,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:12:24,478 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:24,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1132201807, now seen corresponding path program 1 times [2025-03-08 02:12:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820719541] [2025-03-08 02:12:24,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:24,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 02:12:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 02:12:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:12:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820719541] [2025-03-08 02:12:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820719541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:12:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489289586] [2025-03-08 02:12:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:25,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:12:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:25,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:12:25,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:12:25,115 INFO L87 Difference]: Start difference. First operand 128657 states and 139940 transitions. Second operand has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 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-08 02:12:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:28,168 INFO L93 Difference]: Finished difference Result 290949 states and 316577 transitions. [2025-03-08 02:12:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:12:28,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 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 614 [2025-03-08 02:12:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:28,364 INFO L225 Difference]: With dead ends: 290949 [2025-03-08 02:12:28,364 INFO L226 Difference]: Without dead ends: 161017 [2025-03-08 02:12:28,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:12:28,450 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1243 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 3848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:28,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 206 Invalid, 3848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 3226 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:12:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161017 states. [2025-03-08 02:12:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161017 to 130355. [2025-03-08 02:12:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130355 states, 130354 states have (on average 1.0868174355984472) internal successors, (141671), 130354 states have internal predecessors, (141671), 0 states have call successors, (0), 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-08 02:12:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130355 states to 130355 states and 141671 transitions. [2025-03-08 02:12:30,207 INFO L78 Accepts]: Start accepts. Automaton has 130355 states and 141671 transitions. Word has length 614 [2025-03-08 02:12:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 130355 states and 141671 transitions. [2025-03-08 02:12:30,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 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-08 02:12:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 130355 states and 141671 transitions. [2025-03-08 02:12:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-08 02:12:30,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:30,219 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:12:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:12:30,220 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash -492228080, now seen corresponding path program 1 times [2025-03-08 02:12:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430967312] [2025-03-08 02:12:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:30,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-08 02:12:30,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-08 02:12:30,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:30,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 02:12:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430967312] [2025-03-08 02:12:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430967312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:12:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055373319] [2025-03-08 02:12:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:30,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:12:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:12:30,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:30,688 INFO L87 Difference]: Start difference. First operand 130355 states and 141671 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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-08 02:12:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:32,462 INFO L93 Difference]: Finished difference Result 275611 states and 299664 transitions. [2025-03-08 02:12:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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 616 [2025-03-08 02:12:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:32,649 INFO L225 Difference]: With dead ends: 275611 [2025-03-08 02:12:32,649 INFO L226 Difference]: Without dead ends: 145258 [2025-03-08 02:12:32,697 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-08 02:12:32,698 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 320 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:32,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 286 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:12:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145258 states. [2025-03-08 02:12:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145258 to 139713. [2025-03-08 02:12:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139713 states, 139712 states have (on average 1.078998224919835) internal successors, (150749), 139712 states have internal predecessors, (150749), 0 states have call successors, (0), 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-08 02:12:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139713 states to 139713 states and 150749 transitions. [2025-03-08 02:12:34,596 INFO L78 Accepts]: Start accepts. Automaton has 139713 states and 150749 transitions. Word has length 616 [2025-03-08 02:12:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:12:34,596 INFO L471 AbstractCegarLoop]: Abstraction has 139713 states and 150749 transitions. [2025-03-08 02:12:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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-08 02:12:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 139713 states and 150749 transitions. [2025-03-08 02:12:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 02:12:34,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:12:34,609 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:12:34,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:12:34,610 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:12:34,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:12:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1747313032, now seen corresponding path program 1 times [2025-03-08 02:12:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:12:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533894934] [2025-03-08 02:12:34,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:12:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:12:34,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 02:12:34,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 02:12:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:12:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:12:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-08 02:12:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:12:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533894934] [2025-03-08 02:12:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533894934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:12:34,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:12:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:12:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556170923] [2025-03-08 02:12:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:12:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:12:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:12:34,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:12:34,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:12:34,817 INFO L87 Difference]: Start difference. First operand 139713 states and 150749 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 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-08 02:12:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:12:36,045 INFO L93 Difference]: Finished difference Result 270470 states and 291653 transitions. [2025-03-08 02:12:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:12:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 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 650 [2025-03-08 02:12:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:12:36,201 INFO L225 Difference]: With dead ends: 270470 [2025-03-08 02:12:36,201 INFO L226 Difference]: Without dead ends: 130759 [2025-03-08 02:12:36,250 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-08 02:12:36,251 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 583 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:12:36,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 86 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:12:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130759 states.