./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3afcdc3badcfc017ac06c7d51deba84caf5317196fc02e040e398bba430217dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:07,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:07,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:07,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:07,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:07,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:07,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:07,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:07,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:07,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:07,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:07,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:07,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:07,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:07,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:07,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:07,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:07,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:07,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:07,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:07,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:07,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:07,346 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 -> 3afcdc3badcfc017ac06c7d51deba84caf5317196fc02e040e398bba430217dd [2025-03-03 20:07:07,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:07,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:07,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:07,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:07,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:07,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i [2025-03-03 20:07:08,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9ff06ad/593fe4dfc1a34d6687fc2d32bc46bc35/FLAGdbed44cd1 [2025-03-03 20:07:08,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:08,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i [2025-03-03 20:07:08,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9ff06ad/593fe4dfc1a34d6687fc2d32bc46bc35/FLAGdbed44cd1 [2025-03-03 20:07:09,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9ff06ad/593fe4dfc1a34d6687fc2d32bc46bc35 [2025-03-03 20:07:09,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:09,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:09,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:09,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:09,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:09,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15aa2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09, skipping insertion in model container [2025-03-03 20:07:09,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:09,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i[916,929] [2025-03-03 20:07:09,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:09,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:09,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-33.i[916,929] [2025-03-03 20:07:09,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:09,609 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:09,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09 WrapperNode [2025-03-03 20:07:09,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:09,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:09,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:09,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:09,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,686 INFO L138 Inliner]: procedures = 26, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 982 [2025-03-03 20:07:09,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:09,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:09,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:09,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:09,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,729 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:07:09,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:09,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:09,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:09,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:09,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (1/1) ... [2025-03-03 20:07:09,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:09,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:09,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:07:09,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:07:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:09,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:09,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:09,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:09,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:10,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc property_#t~ite98#1;havoc property_#t~bitwise97#1; [2025-03-03 20:07:10,901 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:10,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:10,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:10,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:07:10,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:10 BoogieIcfgContainer [2025-03-03 20:07:10,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:10,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:10,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:10,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:10,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:09" (1/3) ... [2025-03-03 20:07:10,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1347eb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:10, skipping insertion in model container [2025-03-03 20:07:10,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:09" (2/3) ... [2025-03-03 20:07:10,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1347eb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:10, skipping insertion in model container [2025-03-03 20:07:10,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:10" (3/3) ... [2025-03-03 20:07:10,955 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-33.i [2025-03-03 20:07:10,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:10,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-33.i that has 2 procedures, 405 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:11,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:11,037 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;@774555c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:11,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 281 states have internal predecessors, (440), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 20:07:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-03 20:07:11,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:11,069 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:11,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 231811781, now seen corresponding path program 1 times [2025-03-03 20:07:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378148774] [2025-03-03 20:07:11,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:07:11,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:07:11,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:11,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-03-03 20:07:11,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:11,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378148774] [2025-03-03 20:07:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378148774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557432556] [2025-03-03 20:07:11,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:11,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:07:11,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:07:11,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:07:12,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:07:12,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:12,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:12,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1757 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:07:12,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-03-03 20:07:12,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:07:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557432556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:07:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:07:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839902912] [2025-03-03 20:07:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:07:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:07:12,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:12,203 INFO L87 Difference]: Start difference. First operand has 405 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 281 states have internal predecessors, (440), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-03 20:07:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:12,292 INFO L93 Difference]: Finished difference Result 800 states and 1479 transitions. [2025-03-03 20:07:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:07:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) Word has length 778 [2025-03-03 20:07:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:12,303 INFO L225 Difference]: With dead ends: 800 [2025-03-03 20:07:12,304 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 20:07:12,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:12,313 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:12,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 20:07:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-03 20:07:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 274 states have (on average 1.5474452554744527) internal successors, (424), 274 states have internal predecessors, (424), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 20:07:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 668 transitions. [2025-03-03 20:07:12,400 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 668 transitions. Word has length 778 [2025-03-03 20:07:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:12,402 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 668 transitions. [2025-03-03 20:07:12,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-03 20:07:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 668 transitions. [2025-03-03 20:07:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-03 20:07:12,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:12,418 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:12,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:07:12,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:07:12,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 578500038, now seen corresponding path program 1 times [2025-03-03 20:07:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366729069] [2025-03-03 20:07:12,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:12,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:07:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:07:12,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:12,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366729069] [2025-03-03 20:07:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366729069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751515518] [2025-03-03 20:07:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:13,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:13,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:13,320 INFO L87 Difference]: Start difference. First operand 398 states and 668 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:13,449 INFO L93 Difference]: Finished difference Result 989 states and 1663 transitions. [2025-03-03 20:07:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 778 [2025-03-03 20:07:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:13,459 INFO L225 Difference]: With dead ends: 989 [2025-03-03 20:07:13,461 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 20:07:13,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:13,463 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 315 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:13,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1267 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 20:07:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2025-03-03 20:07:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 428 states have (on average 1.574766355140187) internal successors, (674), 429 states have internal predecessors, (674), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 159 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 20:07:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 994 transitions. [2025-03-03 20:07:13,537 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 994 transitions. Word has length 778 [2025-03-03 20:07:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 994 transitions. [2025-03-03 20:07:13,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 994 transitions. [2025-03-03 20:07:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-03 20:07:13,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:13,548 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:13,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2062490568, now seen corresponding path program 1 times [2025-03-03 20:07:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601341556] [2025-03-03 20:07:13,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:13,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:07:13,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:07:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601341556] [2025-03-03 20:07:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601341556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:14,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:14,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:07:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061766240] [2025-03-03 20:07:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:14,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:07:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:14,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:07:14,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:07:14,395 INFO L87 Difference]: Start difference. First operand 591 states and 994 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:15,010 INFO L93 Difference]: Finished difference Result 1995 states and 3365 transitions. [2025-03-03 20:07:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:07:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 778 [2025-03-03 20:07:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:15,023 INFO L225 Difference]: With dead ends: 1995 [2025-03-03 20:07:15,025 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 20:07:15,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:07:15,028 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 920 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:15,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 3574 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 20:07:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1072. [2025-03-03 20:07:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 839 states have (on average 1.6257449344457688) internal successors, (1364), 842 states have internal predecessors, (1364), 228 states have call successors, (228), 4 states have call predecessors, (228), 4 states have return successors, (228), 225 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:07:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1820 transitions. [2025-03-03 20:07:15,103 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1820 transitions. Word has length 778 [2025-03-03 20:07:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:15,104 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1820 transitions. [2025-03-03 20:07:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1820 transitions. [2025-03-03 20:07:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-03 20:07:15,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:15,110 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:15,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -378131191, now seen corresponding path program 1 times [2025-03-03 20:07:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254120372] [2025-03-03 20:07:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-03 20:07:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-03 20:07:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254120372] [2025-03-03 20:07:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254120372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275871879] [2025-03-03 20:07:15,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:15,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:15,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:15,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:15,628 INFO L87 Difference]: Start difference. First operand 1072 states and 1820 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:15,877 INFO L93 Difference]: Finished difference Result 2855 states and 4837 transitions. [2025-03-03 20:07:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 778 [2025-03-03 20:07:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:15,887 INFO L225 Difference]: With dead ends: 2855 [2025-03-03 20:07:15,887 INFO L226 Difference]: Without dead ends: 1786 [2025-03-03 20:07:15,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:15,890 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 330 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:15,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1797 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:07:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-03-03 20:07:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1072. [2025-03-03 20:07:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 839 states have (on average 1.6257449344457688) internal successors, (1364), 842 states have internal predecessors, (1364), 228 states have call successors, (228), 4 states have call predecessors, (228), 4 states have return successors, (228), 225 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:07:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1820 transitions. [2025-03-03 20:07:15,949 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1820 transitions. Word has length 778 [2025-03-03 20:07:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:15,950 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1820 transitions. [2025-03-03 20:07:15,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1820 transitions. [2025-03-03 20:07:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:07:15,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:15,957 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:15,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:15,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1290445115, now seen corresponding path program 1 times [2025-03-03 20:07:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301937908] [2025-03-03 20:07:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:15,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:07:16,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:07:16,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301937908] [2025-03-03 20:07:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301937908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967640981] [2025-03-03 20:07:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:16,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:16,569 INFO L87 Difference]: Start difference. First operand 1072 states and 1820 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:16,678 INFO L93 Difference]: Finished difference Result 3210 states and 5454 transitions. [2025-03-03 20:07:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:16,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 779 [2025-03-03 20:07:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:16,688 INFO L225 Difference]: With dead ends: 3210 [2025-03-03 20:07:16,688 INFO L226 Difference]: Without dead ends: 2141 [2025-03-03 20:07:16,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:16,692 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 397 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:16,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1281 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-03-03 20:07:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2139. [2025-03-03 20:07:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1674 states have (on average 1.6248506571087216) internal successors, (2720), 1680 states have internal predecessors, (2720), 456 states have call successors, (456), 8 states have call predecessors, (456), 8 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2025-03-03 20:07:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3632 transitions. [2025-03-03 20:07:16,811 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3632 transitions. Word has length 779 [2025-03-03 20:07:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:16,812 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 3632 transitions. [2025-03-03 20:07:16,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3632 transitions. [2025-03-03 20:07:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:07:16,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:16,818 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:16,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:16,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash -747611174, now seen corresponding path program 1 times [2025-03-03 20:07:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837138499] [2025-03-03 20:07:16,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:16,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:16,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:07:16,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:07:16,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:16,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837138499] [2025-03-03 20:07:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837138499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069490311] [2025-03-03 20:07:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:17,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:17,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:17,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:17,532 INFO L87 Difference]: Start difference. First operand 2139 states and 3632 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:18,442 INFO L93 Difference]: Finished difference Result 7181 states and 12191 transitions. [2025-03-03 20:07:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 779 [2025-03-03 20:07:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:18,469 INFO L225 Difference]: With dead ends: 7181 [2025-03-03 20:07:18,469 INFO L226 Difference]: Without dead ends: 5045 [2025-03-03 20:07:18,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:18,477 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 825 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:18,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1994 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:07:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2025-03-03 20:07:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4279. [2025-03-03 20:07:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4279 states, 3350 states have (on average 1.6250746268656717) internal successors, (5444), 3362 states have internal predecessors, (5444), 912 states have call successors, (912), 16 states have call predecessors, (912), 16 states have return successors, (912), 900 states have call predecessors, (912), 912 states have call successors, (912) [2025-03-03 20:07:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 7268 transitions. [2025-03-03 20:07:18,797 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 7268 transitions. Word has length 779 [2025-03-03 20:07:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 4279 states and 7268 transitions. [2025-03-03 20:07:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 7268 transitions. [2025-03-03 20:07:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 20:07:18,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:18,805 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:18,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:18,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1180288623, now seen corresponding path program 1 times [2025-03-03 20:07:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:18,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323983695] [2025-03-03 20:07:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:18,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 20:07:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 20:07:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:19,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323983695] [2025-03-03 20:07:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323983695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917459066] [2025-03-03 20:07:19,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:19,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:19,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:19,731 INFO L87 Difference]: Start difference. First operand 4279 states and 7268 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:20,428 INFO L93 Difference]: Finished difference Result 10446 states and 17744 transitions. [2025-03-03 20:07:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:20,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 779 [2025-03-03 20:07:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:20,462 INFO L225 Difference]: With dead ends: 10446 [2025-03-03 20:07:20,462 INFO L226 Difference]: Without dead ends: 6170 [2025-03-03 20:07:20,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:20,476 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 668 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:20,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1874 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2025-03-03 20:07:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 5976. [2025-03-03 20:07:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 4922 states have (on average 1.6468915075172694) internal successors, (8106), 4934 states have internal predecessors, (8106), 1034 states have call successors, (1034), 19 states have call predecessors, (1034), 19 states have return successors, (1034), 1022 states have call predecessors, (1034), 1034 states have call successors, (1034) [2025-03-03 20:07:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 10174 transitions. [2025-03-03 20:07:20,939 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 10174 transitions. Word has length 779 [2025-03-03 20:07:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 5976 states and 10174 transitions. [2025-03-03 20:07:20,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 10174 transitions. [2025-03-03 20:07:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-03-03 20:07:20,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:20,957 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:20,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:07:20,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:20,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -324830661, now seen corresponding path program 1 times [2025-03-03 20:07:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304400414] [2025-03-03 20:07:20,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:21,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-03-03 20:07:21,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-03-03 20:07:21,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:21,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304400414] [2025-03-03 20:07:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304400414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597384577] [2025-03-03 20:07:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:21,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:21,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:21,466 INFO L87 Difference]: Start difference. First operand 5976 states and 10174 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:22,056 INFO L93 Difference]: Finished difference Result 10590 states and 17920 transitions. [2025-03-03 20:07:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 780 [2025-03-03 20:07:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:22,086 INFO L225 Difference]: With dead ends: 10590 [2025-03-03 20:07:22,089 INFO L226 Difference]: Without dead ends: 6106 [2025-03-03 20:07:22,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:22,103 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 665 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:22,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1879 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2025-03-03 20:07:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 5992. [2025-03-03 20:07:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5992 states, 4938 states have (on average 1.6415552855407047) internal successors, (8106), 4950 states have internal predecessors, (8106), 1034 states have call successors, (1034), 19 states have call predecessors, (1034), 19 states have return successors, (1034), 1022 states have call predecessors, (1034), 1034 states have call successors, (1034) [2025-03-03 20:07:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5992 states to 5992 states and 10174 transitions. [2025-03-03 20:07:22,456 INFO L78 Accepts]: Start accepts. Automaton has 5992 states and 10174 transitions. Word has length 780 [2025-03-03 20:07:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:22,457 INFO L471 AbstractCegarLoop]: Abstraction has 5992 states and 10174 transitions. [2025-03-03 20:07:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5992 states and 10174 transitions. [2025-03-03 20:07:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-03-03 20:07:22,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:22,464 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:07:22,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1321997885, now seen corresponding path program 1 times [2025-03-03 20:07:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397638481] [2025-03-03 20:07:22,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:22,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-03 20:07:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-03 20:07:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397638481] [2025-03-03 20:07:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397638481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685296058] [2025-03-03 20:07:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:23,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:23,106 INFO L87 Difference]: Start difference. First operand 5992 states and 10174 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:24,485 INFO L93 Difference]: Finished difference Result 21889 states and 37098 transitions. [2025-03-03 20:07:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 781 [2025-03-03 20:07:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:24,540 INFO L225 Difference]: With dead ends: 21889 [2025-03-03 20:07:24,540 INFO L226 Difference]: Without dead ends: 16853 [2025-03-03 20:07:24,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:24,559 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 1140 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:24,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2378 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:07:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16853 states. [2025-03-03 20:07:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16853 to 16849. [2025-03-03 20:07:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16849 states, 13939 states have (on average 1.6393571992251954) internal successors, (22851), 13975 states have internal predecessors, (22851), 2858 states have call successors, (2858), 51 states have call predecessors, (2858), 51 states have return successors, (2858), 2822 states have call predecessors, (2858), 2858 states have call successors, (2858) [2025-03-03 20:07:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16849 states to 16849 states and 28567 transitions. [2025-03-03 20:07:25,469 INFO L78 Accepts]: Start accepts. Automaton has 16849 states and 28567 transitions. Word has length 781 [2025-03-03 20:07:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:25,470 INFO L471 AbstractCegarLoop]: Abstraction has 16849 states and 28567 transitions. [2025-03-03 20:07:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16849 states and 28567 transitions. [2025-03-03 20:07:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 20:07:25,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:25,479 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:07:25,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -4332083, now seen corresponding path program 1 times [2025-03-03 20:07:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64178919] [2025-03-03 20:07:25,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:25,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 20:07:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 20:07:25,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64178919] [2025-03-03 20:07:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64178919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316423617] [2025-03-03 20:07:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:25,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:25,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:25,906 INFO L87 Difference]: Start difference. First operand 16849 states and 28567 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:26,923 INFO L93 Difference]: Finished difference Result 50495 states and 85641 transitions. [2025-03-03 20:07:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 782 [2025-03-03 20:07:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:27,031 INFO L225 Difference]: With dead ends: 50495 [2025-03-03 20:07:27,031 INFO L226 Difference]: Without dead ends: 36028 [2025-03-03 20:07:27,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:27,086 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1391 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 2736 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36028 states. [2025-03-03 20:07:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36028 to 23715. [2025-03-03 20:07:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23715 states, 20437 states have (on average 1.6690805891275629) internal successors, (34111), 20489 states have internal predecessors, (34111), 3210 states have call successors, (3210), 67 states have call predecessors, (3210), 67 states have return successors, (3210), 3158 states have call predecessors, (3210), 3210 states have call successors, (3210) [2025-03-03 20:07:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23715 states to 23715 states and 40531 transitions. [2025-03-03 20:07:28,856 INFO L78 Accepts]: Start accepts. Automaton has 23715 states and 40531 transitions. Word has length 782 [2025-03-03 20:07:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:28,857 INFO L471 AbstractCegarLoop]: Abstraction has 23715 states and 40531 transitions. [2025-03-03 20:07:28,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23715 states and 40531 transitions. [2025-03-03 20:07:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 20:07:28,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:28,870 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:28,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:28,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -646600809, now seen corresponding path program 1 times [2025-03-03 20:07:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424476367] [2025-03-03 20:07:28,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 20:07:29,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 20:07:29,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:29,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424476367] [2025-03-03 20:07:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424476367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:29,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:07:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044999704] [2025-03-03 20:07:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:29,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:07:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:29,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:07:29,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:07:29,609 INFO L87 Difference]: Start difference. First operand 23715 states and 40531 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:32,996 INFO L93 Difference]: Finished difference Result 121572 states and 205483 transitions. [2025-03-03 20:07:32,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:07:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 782 [2025-03-03 20:07:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:33,332 INFO L225 Difference]: With dead ends: 121572 [2025-03-03 20:07:33,333 INFO L226 Difference]: Without dead ends: 100412 [2025-03-03 20:07:33,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:33,408 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 2124 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:33,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 2540 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:07:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100412 states. [2025-03-03 20:07:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100412 to 66728. [2025-03-03 20:07:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66728 states, 61281 states have (on average 1.7157846640883798) internal successors, (105145), 61397 states have internal predecessors, (105145), 5314 states have call successors, (5314), 132 states have call predecessors, (5314), 132 states have return successors, (5314), 5198 states have call predecessors, (5314), 5314 states have call successors, (5314) [2025-03-03 20:07:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66728 states to 66728 states and 115773 transitions. [2025-03-03 20:07:36,380 INFO L78 Accepts]: Start accepts. Automaton has 66728 states and 115773 transitions. Word has length 782 [2025-03-03 20:07:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:36,383 INFO L471 AbstractCegarLoop]: Abstraction has 66728 states and 115773 transitions. [2025-03-03 20:07:36,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 66728 states and 115773 transitions. [2025-03-03 20:07:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 20:07:36,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:36,411 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:07:36,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 598163672, now seen corresponding path program 1 times [2025-03-03 20:07:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354547557] [2025-03-03 20:07:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:36,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 20:07:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 20:07:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354547557] [2025-03-03 20:07:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354547557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255913525] [2025-03-03 20:07:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:36,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:36,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:36,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:36,813 INFO L87 Difference]: Start difference. First operand 66728 states and 115773 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:37,979 INFO L93 Difference]: Finished difference Result 133058 states and 230848 transitions. [2025-03-03 20:07:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 782 [2025-03-03 20:07:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:38,152 INFO L225 Difference]: With dead ends: 133058 [2025-03-03 20:07:38,152 INFO L226 Difference]: Without dead ends: 67076 [2025-03-03 20:07:38,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:38,428 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 0 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:38,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1918 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67076 states. [2025-03-03 20:07:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67076 to 67076. [2025-03-03 20:07:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67076 states, 61629 states have (on average 1.711742848334388) internal successors, (105493), 61745 states have internal predecessors, (105493), 5314 states have call successors, (5314), 132 states have call predecessors, (5314), 132 states have return successors, (5314), 5198 states have call predecessors, (5314), 5314 states have call successors, (5314) [2025-03-03 20:07:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67076 states to 67076 states and 116121 transitions. [2025-03-03 20:07:40,947 INFO L78 Accepts]: Start accepts. Automaton has 67076 states and 116121 transitions. Word has length 782 [2025-03-03 20:07:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:40,947 INFO L471 AbstractCegarLoop]: Abstraction has 67076 states and 116121 transitions. [2025-03-03 20:07:40,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:07:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 67076 states and 116121 transitions. [2025-03-03 20:07:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 20:07:40,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:40,970 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:07:40,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1510869577, now seen corresponding path program 1 times [2025-03-03 20:07:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913714666] [2025-03-03 20:07:40,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 20:07:41,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 20:07:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913714666] [2025-03-03 20:07:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913714666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983604615] [2025-03-03 20:07:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:42,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:42,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:42,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:42,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:42,174 INFO L87 Difference]: Start difference. First operand 67076 states and 116121 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-03 20:07:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:47,849 INFO L93 Difference]: Finished difference Result 315705 states and 547331 transitions. [2025-03-03 20:07:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 782 [2025-03-03 20:07:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:48,456 INFO L225 Difference]: With dead ends: 315705 [2025-03-03 20:07:48,456 INFO L226 Difference]: Without dead ends: 252303 [2025-03-03 20:07:48,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:48,618 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1679 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:48,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 3137 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:07:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252303 states. [2025-03-03 20:07:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252303 to 252273. [2025-03-03 20:07:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252273 states, 232689 states have (on average 1.7101753843112482) internal successors, (397939), 233177 states have internal predecessors, (397939), 19066 states have call successors, (19066), 517 states have call predecessors, (19066), 517 states have return successors, (19066), 18578 states have call predecessors, (19066), 19066 states have call successors, (19066) [2025-03-03 20:07:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252273 states to 252273 states and 436071 transitions. [2025-03-03 20:07:57,762 INFO L78 Accepts]: Start accepts. Automaton has 252273 states and 436071 transitions. Word has length 782 [2025-03-03 20:07:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:57,763 INFO L471 AbstractCegarLoop]: Abstraction has 252273 states and 436071 transitions. [2025-03-03 20:07:57,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-03 20:07:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 252273 states and 436071 transitions. [2025-03-03 20:07:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2025-03-03 20:07:57,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:57,892 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:57,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:07:57,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:57,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 439346343, now seen corresponding path program 1 times [2025-03-03 20:07:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115458378] [2025-03-03 20:07:57,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:57,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-03-03 20:07:57,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-03-03 20:07:57,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:57,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-03 20:07:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115458378] [2025-03-03 20:07:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115458378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549631688] [2025-03-03 20:07:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:58,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:58,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:58,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:58,106 INFO L87 Difference]: Start difference. First operand 252273 states and 436071 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-03 20:08:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:07,727 INFO L93 Difference]: Finished difference Result 649394 states and 1122678 transitions. [2025-03-03 20:08:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 783 [2025-03-03 20:08:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:08,674 INFO L225 Difference]: With dead ends: 649394 [2025-03-03 20:08:08,675 INFO L226 Difference]: Without dead ends: 397349 [2025-03-03 20:08:08,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:08,899 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 393 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:08,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1336 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397349 states. [2025-03-03 20:08:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397349 to 396963. [2025-03-03 20:08:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396963 states, 367011 states have (on average 1.7092539460670115) internal successors, (627315), 367883 states have internal predecessors, (627315), 29050 states have call successors, (29050), 901 states have call predecessors, (29050), 901 states have return successors, (29050), 28178 states have call predecessors, (29050), 29050 states have call successors, (29050)