./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5be1985e273f5c8eee31a67418035a8392c7bd6f53e92cf10ee992185aae91b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:12,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:12,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:59:12,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:12,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:12,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:12,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:12,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:12,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:12,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:12,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:12,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:12,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:12,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:12,562 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:12,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:12,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:12,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:12,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:12,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:12,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:12,567 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-jdk21/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 -> 5be1985e273f5c8eee31a67418035a8392c7bd6f53e92cf10ee992185aae91b7 [2025-02-05 21:59:12,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:12,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:12,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:12,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:12,818 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:12,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i [2025-02-05 21:59:13,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4573120c4/37f097f13b2c46bfbe4ec5abf9293cf3/FLAGb9a921f78 [2025-02-05 21:59:14,295 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:14,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i [2025-02-05 21:59:14,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4573120c4/37f097f13b2c46bfbe4ec5abf9293cf3/FLAGb9a921f78 [2025-02-05 21:59:14,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4573120c4/37f097f13b2c46bfbe4ec5abf9293cf3 [2025-02-05 21:59:14,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:14,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:14,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:14,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:14,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:14,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2811c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14, skipping insertion in model container [2025-02-05 21:59:14,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:14,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i[916,929] [2025-02-05 21:59:14,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:14,632 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:14,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-58.i[916,929] [2025-02-05 21:59:14,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:14,719 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:14,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14 WrapperNode [2025-02-05 21:59:14,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:14,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:14,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:14,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:14,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,780 INFO L138 Inliner]: procedures = 26, calls = 119, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 832 [2025-02-05 21:59:14,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:14,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:14,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:14,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:14,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,810 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-02-05 21:59:14,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:14,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:14,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:14,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:14,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:14,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:14,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:59:14,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:59:14,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:14,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:14,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:14,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:15,003 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:15,005 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:15,800 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:15,800 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:15,824 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:15,825 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:59:15,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:15 BoogieIcfgContainer [2025-02-05 21:59:15,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:15,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:15,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:15,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:15,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:14" (1/3) ... [2025-02-05 21:59:15,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195a12bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:15, skipping insertion in model container [2025-02-05 21:59:15,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (2/3) ... [2025-02-05 21:59:15,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195a12bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:15, skipping insertion in model container [2025-02-05 21:59:15,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:15" (3/3) ... [2025-02-05 21:59:15,831 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-58.i [2025-02-05 21:59:15,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:15,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-58.i that has 2 procedures, 347 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:15,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:15,892 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;@7ced5c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:15,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 238 states have (on average 1.5924369747899159) internal successors, (379), 239 states have internal predecessors, (379), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:59:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:15,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:15,926 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:15,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1029986492, now seen corresponding path program 1 times [2025-02-05 21:59:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948914543] [2025-02-05 21:59:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:16,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:16,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-05 21:59:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948914543] [2025-02-05 21:59:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948914543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766576324] [2025-02-05 21:59:16,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:16,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:16,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:59:16,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:16,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-05 21:59:16,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766576324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108884716] [2025-02-05 21:59:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:16,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:16,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:16,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:16,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:16,944 INFO L87 Difference]: Start difference. First operand has 347 states, 238 states have (on average 1.5924369747899159) internal successors, (379), 239 states have internal predecessors, (379), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:17,029 INFO L93 Difference]: Finished difference Result 688 states and 1283 transitions. [2025-02-05 21:59:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:17,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) Word has length 683 [2025-02-05 21:59:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:17,039 INFO L225 Difference]: With dead ends: 688 [2025-02-05 21:59:17,041 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 21:59:17,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 684 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-02-05 21:59:17,048 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:17,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 21:59:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 21:59:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 236 states have (on average 1.5805084745762712) internal successors, (373), 236 states have internal predecessors, (373), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:59:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 585 transitions. [2025-02-05 21:59:17,122 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 585 transitions. Word has length 683 [2025-02-05 21:59:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:17,122 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 585 transitions. [2025-02-05 21:59:17,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 585 transitions. [2025-02-05 21:59:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:17,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:17,132 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:17,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:59:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:59:17,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -866970152, now seen corresponding path program 1 times [2025-02-05 21:59:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:17,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268702290] [2025-02-05 21:59:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:17,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268702290] [2025-02-05 21:59:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268702290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93259050] [2025-02-05 21:59:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:18,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:18,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,018 INFO L87 Difference]: Start difference. First operand 344 states and 585 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:18,214 INFO L93 Difference]: Finished difference Result 999 states and 1702 transitions. [2025-02-05 21:59:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:18,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-02-05 21:59:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:18,220 INFO L225 Difference]: With dead ends: 999 [2025-02-05 21:59:18,220 INFO L226 Difference]: Without dead ends: 658 [2025-02-05 21:59:18,221 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-02-05 21:59:18,221 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 537 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:18,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1076 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-05 21:59:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 347. [2025-02-05 21:59:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:59:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 590 transitions. [2025-02-05 21:59:18,280 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 590 transitions. Word has length 683 [2025-02-05 21:59:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:18,285 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 590 transitions. [2025-02-05 21:59:18,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 590 transitions. [2025-02-05 21:59:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:18,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:18,301 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:18,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 931217045, now seen corresponding path program 1 times [2025-02-05 21:59:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:18,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919790065] [2025-02-05 21:59:18,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:18,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:18,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:18,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:18,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919790065] [2025-02-05 21:59:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919790065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087783005] [2025-02-05 21:59:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:18,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:18,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,629 INFO L87 Difference]: Start difference. First operand 347 states and 590 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:18,755 INFO L93 Difference]: Finished difference Result 1033 states and 1760 transitions. [2025-02-05 21:59:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-02-05 21:59:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:18,761 INFO L225 Difference]: With dead ends: 1033 [2025-02-05 21:59:18,761 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 21:59:18,762 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-02-05 21:59:18,762 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 569 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:18,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1461 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 21:59:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 687. [2025-02-05 21:59:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 472 states have (on average 1.5741525423728813) internal successors, (743), 472 states have internal predecessors, (743), 212 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (212), 212 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 21:59:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1167 transitions. [2025-02-05 21:59:18,827 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1167 transitions. Word has length 683 [2025-02-05 21:59:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1167 transitions. [2025-02-05 21:59:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1167 transitions. [2025-02-05 21:59:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:18,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:18,833 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:18,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1731262517, now seen corresponding path program 1 times [2025-02-05 21:59:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219428242] [2025-02-05 21:59:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:18,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219428242] [2025-02-05 21:59:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219428242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642562209] [2025-02-05 21:59:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:19,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:19,206 INFO L87 Difference]: Start difference. First operand 687 states and 1167 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:19,297 INFO L93 Difference]: Finished difference Result 1371 states and 2331 transitions. [2025-02-05 21:59:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 683 [2025-02-05 21:59:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:19,303 INFO L225 Difference]: With dead ends: 1371 [2025-02-05 21:59:19,303 INFO L226 Difference]: Without dead ends: 687 [2025-02-05 21:59:19,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:19,305 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 486 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:19,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1102 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-05 21:59:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-02-05 21:59:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 472 states have (on average 1.569915254237288) internal successors, (741), 472 states have internal predecessors, (741), 212 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (212), 212 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 21:59:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1165 transitions. [2025-02-05 21:59:19,383 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1165 transitions. Word has length 683 [2025-02-05 21:59:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:19,384 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1165 transitions. [2025-02-05 21:59:19,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1165 transitions. [2025-02-05 21:59:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:19,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:19,389 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:19,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 564566198, now seen corresponding path program 1 times [2025-02-05 21:59:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154820304] [2025-02-05 21:59:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:19,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154820304] [2025-02-05 21:59:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154820304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527815766] [2025-02-05 21:59:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:19,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:19,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:19,633 INFO L87 Difference]: Start difference. First operand 687 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:19,738 INFO L93 Difference]: Finished difference Result 1787 states and 3043 transitions. [2025-02-05 21:59:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-02-05 21:59:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:19,747 INFO L225 Difference]: With dead ends: 1787 [2025-02-05 21:59:19,747 INFO L226 Difference]: Without dead ends: 1103 [2025-02-05 21:59:19,750 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-02-05 21:59:19,750 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 328 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:19,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1351 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-05 21:59:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1099. [2025-02-05 21:59:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 830 states have (on average 1.621686746987952) internal successors, (1346), 832 states have internal predecessors, (1346), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 262 states have call predecessors, (264), 264 states have call successors, (264) [2025-02-05 21:59:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1874 transitions. [2025-02-05 21:59:19,857 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1874 transitions. Word has length 683 [2025-02-05 21:59:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1874 transitions. [2025-02-05 21:59:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1874 transitions. [2025-02-05 21:59:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-02-05 21:59:19,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:19,866 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:19,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2080264299, now seen corresponding path program 1 times [2025-02-05 21:59:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270656724] [2025-02-05 21:59:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:19,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-05 21:59:19,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-05 21:59:19,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270656724] [2025-02-05 21:59:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270656724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:20,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:20,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307341221] [2025-02-05 21:59:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:20,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:20,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:20,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:20,098 INFO L87 Difference]: Start difference. First operand 1099 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:20,254 INFO L93 Difference]: Finished difference Result 3287 states and 5608 transitions. [2025-02-05 21:59:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-02-05 21:59:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:20,268 INFO L225 Difference]: With dead ends: 3287 [2025-02-05 21:59:20,268 INFO L226 Difference]: Without dead ends: 2191 [2025-02-05 21:59:20,271 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-02-05 21:59:20,273 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 563 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:20,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1533 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2025-02-05 21:59:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2025-02-05 21:59:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1652 states have (on average 1.6150121065375302) internal successors, (2668), 1656 states have internal predecessors, (2668), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 524 states have call predecessors, (528), 528 states have call successors, (528) [2025-02-05 21:59:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3724 transitions. [2025-02-05 21:59:20,434 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3724 transitions. Word has length 683 [2025-02-05 21:59:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:20,435 INFO L471 AbstractCegarLoop]: Abstraction has 2189 states and 3724 transitions. [2025-02-05 21:59:20,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3724 transitions. [2025-02-05 21:59:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-02-05 21:59:20,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:20,441 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:20,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701043, now seen corresponding path program 1 times [2025-02-05 21:59:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978146418] [2025-02-05 21:59:20,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-02-05 21:59:20,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-02-05 21:59:20,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:20,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978146418] [2025-02-05 21:59:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978146418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180839391] [2025-02-05 21:59:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:20,926 INFO L87 Difference]: Start difference. First operand 2189 states and 3724 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:21,161 INFO L93 Difference]: Finished difference Result 6561 states and 11166 transitions. [2025-02-05 21:59:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 684 [2025-02-05 21:59:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:21,184 INFO L225 Difference]: With dead ends: 6561 [2025-02-05 21:59:21,184 INFO L226 Difference]: Without dead ends: 4375 [2025-02-05 21:59:21,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:21,192 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 445 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:21,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1672 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2025-02-05 21:59:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4373. [2025-02-05 21:59:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 3300 states have (on average 1.6133333333333333) internal successors, (5324), 3308 states have internal predecessors, (5324), 1056 states have call successors, (1056), 16 states have call predecessors, (1056), 16 states have return successors, (1056), 1048 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-02-05 21:59:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 7436 transitions. [2025-02-05 21:59:21,562 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 7436 transitions. Word has length 684 [2025-02-05 21:59:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:21,563 INFO L471 AbstractCegarLoop]: Abstraction has 4373 states and 7436 transitions. [2025-02-05 21:59:21,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:59:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 7436 transitions. [2025-02-05 21:59:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:59:21,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:21,572 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:21,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:21,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:21,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1545769399, now seen corresponding path program 1 times [2025-02-05 21:59:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663366545] [2025-02-05 21:59:21,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:21,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:59:21,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:59:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663366545] [2025-02-05 21:59:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663366545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268121628] [2025-02-05 21:59:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:22,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:22,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:22,011 INFO L87 Difference]: Start difference. First operand 4373 states and 7436 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:22,423 INFO L93 Difference]: Finished difference Result 13161 states and 22382 transitions. [2025-02-05 21:59:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 685 [2025-02-05 21:59:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:22,462 INFO L225 Difference]: With dead ends: 13161 [2025-02-05 21:59:22,462 INFO L226 Difference]: Without dead ends: 8791 [2025-02-05 21:59:22,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:22,474 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 397 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:22,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2006 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2025-02-05 21:59:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 8757. [2025-02-05 21:59:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 6612 states have (on average 1.6098003629764066) internal successors, (10644), 6628 states have internal predecessors, (10644), 2112 states have call successors, (2112), 32 states have call predecessors, (2112), 32 states have return successors, (2112), 2096 states have call predecessors, (2112), 2112 states have call successors, (2112) [2025-02-05 21:59:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14868 transitions. [2025-02-05 21:59:23,040 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14868 transitions. Word has length 685 [2025-02-05 21:59:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:23,041 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14868 transitions. [2025-02-05 21:59:23,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14868 transitions. [2025-02-05 21:59:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:59:23,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:23,095 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:23,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash 561228247, now seen corresponding path program 1 times [2025-02-05 21:59:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986368919] [2025-02-05 21:59:23,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:59:23,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:59:23,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:23,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986368919] [2025-02-05 21:59:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986368919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:23,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152326773] [2025-02-05 21:59:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:23,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:23,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:23,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:23,667 INFO L87 Difference]: Start difference. First operand 8757 states and 14868 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:23,996 INFO L93 Difference]: Finished difference Result 17511 states and 29733 transitions. [2025-02-05 21:59:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:23,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 685 [2025-02-05 21:59:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:24,070 INFO L225 Difference]: With dead ends: 17511 [2025-02-05 21:59:24,070 INFO L226 Difference]: Without dead ends: 8757 [2025-02-05 21:59:24,120 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-02-05 21:59:24,121 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 337 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:24,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 567 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2025-02-05 21:59:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 8757. [2025-02-05 21:59:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 6612 states have (on average 1.6049606775559588) internal successors, (10612), 6628 states have internal predecessors, (10612), 2112 states have call successors, (2112), 32 states have call predecessors, (2112), 32 states have return successors, (2112), 2096 states have call predecessors, (2112), 2112 states have call successors, (2112) [2025-02-05 21:59:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14836 transitions. [2025-02-05 21:59:24,689 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14836 transitions. Word has length 685 [2025-02-05 21:59:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14836 transitions. [2025-02-05 21:59:24,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14836 transitions. [2025-02-05 21:59:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:59:24,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:24,700 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:24,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 50694070, now seen corresponding path program 1 times [2025-02-05 21:59:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893725882] [2025-02-05 21:59:24,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:59:24,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:59:24,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:24,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893725882] [2025-02-05 21:59:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893725882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774459896] [2025-02-05 21:59:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:25,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:25,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:25,092 INFO L87 Difference]: Start difference. First operand 8757 states and 14836 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:25,904 INFO L93 Difference]: Finished difference Result 30523 states and 51895 transitions. [2025-02-05 21:59:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 685 [2025-02-05 21:59:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:25,975 INFO L225 Difference]: With dead ends: 30523 [2025-02-05 21:59:25,976 INFO L226 Difference]: Without dead ends: 21769 [2025-02-05 21:59:26,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:26,003 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 676 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:26,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1756 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:59:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21769 states. [2025-02-05 21:59:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21769 to 21733. [2025-02-05 21:59:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21733 states, 17540 states have (on average 1.6367160775370582) internal successors, (28708), 17620 states have internal predecessors, (28708), 4096 states have call successors, (4096), 96 states have call predecessors, (4096), 96 states have return successors, (4096), 4016 states have call predecessors, (4096), 4096 states have call successors, (4096) [2025-02-05 21:59:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21733 states to 21733 states and 36900 transitions. [2025-02-05 21:59:27,275 INFO L78 Accepts]: Start accepts. Automaton has 21733 states and 36900 transitions. Word has length 685 [2025-02-05 21:59:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:27,276 INFO L471 AbstractCegarLoop]: Abstraction has 21733 states and 36900 transitions. [2025-02-05 21:59:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21733 states and 36900 transitions. [2025-02-05 21:59:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:59:27,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:27,293 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:27,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:27,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1512274069, now seen corresponding path program 1 times [2025-02-05 21:59:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705345553] [2025-02-05 21:59:27,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:27,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:59:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:59:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:28,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705345553] [2025-02-05 21:59:28,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705345553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:28,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:59:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711676230] [2025-02-05 21:59:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:28,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:59:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:28,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:59:28,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:59:28,072 INFO L87 Difference]: Start difference. First operand 21733 states and 36900 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:30,529 INFO L93 Difference]: Finished difference Result 51819 states and 87770 transitions. [2025-02-05 21:59:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:59:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 685 [2025-02-05 21:59:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:30,656 INFO L225 Difference]: With dead ends: 51819 [2025-02-05 21:59:30,656 INFO L226 Difference]: Without dead ends: 40977 [2025-02-05 21:59:30,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:59:30,698 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 2647 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2647 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2647 Valid, 3224 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:59:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40977 states. [2025-02-05 21:59:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40977 to 37754. [2025-02-05 21:59:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37754 states, 30985 states have (on average 1.6421171534613523) internal successors, (50881), 31162 states have internal predecessors, (50881), 6575 states have call successors, (6575), 193 states have call predecessors, (6575), 193 states have return successors, (6575), 6398 states have call predecessors, (6575), 6575 states have call successors, (6575) [2025-02-05 21:59:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37754 states to 37754 states and 64031 transitions. [2025-02-05 21:59:32,810 INFO L78 Accepts]: Start accepts. Automaton has 37754 states and 64031 transitions. Word has length 685 [2025-02-05 21:59:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 37754 states and 64031 transitions. [2025-02-05 21:59:32,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37754 states and 64031 transitions. [2025-02-05 21:59:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:59:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:32,844 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:59:32,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -472141558, now seen corresponding path program 1 times [2025-02-05 21:59:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953639781] [2025-02-05 21:59:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:32,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:59:32,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:59:32,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:32,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953639781] [2025-02-05 21:59:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953639781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165529007] [2025-02-05 21:59:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:33,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:33,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:33,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:33,257 INFO L87 Difference]: Start difference. First operand 37754 states and 64031 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:34,518 INFO L93 Difference]: Finished difference Result 75450 states and 127969 transitions. [2025-02-05 21:59:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 685 [2025-02-05 21:59:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:34,732 INFO L225 Difference]: With dead ends: 75450 [2025-02-05 21:59:34,733 INFO L226 Difference]: Without dead ends: 64584 [2025-02-05 21:59:34,775 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-02-05 21:59:34,776 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 393 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:34,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1126 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64584 states. [2025-02-05 21:59:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64584 to 64534. [2025-02-05 21:59:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64534 states, 53129 states have (on average 1.6416081612678575) internal successors, (87217), 53442 states have internal predecessors, (87217), 11067 states have call successors, (11067), 337 states have call predecessors, (11067), 337 states have return successors, (11067), 10754 states have call predecessors, (11067), 11067 states have call successors, (11067) [2025-02-05 21:59:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64534 states to 64534 states and 109351 transitions. [2025-02-05 21:59:38,600 INFO L78 Accepts]: Start accepts. Automaton has 64534 states and 109351 transitions. Word has length 685 [2025-02-05 21:59:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 64534 states and 109351 transitions. [2025-02-05 21:59:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64534 states and 109351 transitions. [2025-02-05 21:59:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 21:59:38,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:38,657 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:38,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:59:38,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 127155266, now seen corresponding path program 1 times [2025-02-05 21:59:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531537269] [2025-02-05 21:59:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:38,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 21:59:39,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 21:59:39,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:39,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531537269] [2025-02-05 21:59:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531537269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843802198] [2025-02-05 21:59:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:39,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:39,389 INFO L87 Difference]: Start difference. First operand 64534 states and 109351 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:42,022 INFO L93 Difference]: Finished difference Result 138846 states and 234890 transitions. [2025-02-05 21:59:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 686 [2025-02-05 21:59:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:42,306 INFO L225 Difference]: With dead ends: 138846 [2025-02-05 21:59:42,306 INFO L226 Difference]: Without dead ends: 74372 [2025-02-05 21:59:42,443 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-02-05 21:59:42,444 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 922 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:42,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 2009 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:59:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74372 states. [2025-02-05 21:59:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74372 to 74248. [2025-02-05 21:59:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74248 states, 60035 states have (on average 1.628799866744399) internal successors, (97785), 60408 states have internal predecessors, (97785), 13779 states have call successors, (13779), 433 states have call predecessors, (13779), 433 states have return successors, (13779), 13406 states have call predecessors, (13779), 13779 states have call successors, (13779) [2025-02-05 21:59:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74248 states to 74248 states and 125343 transitions. [2025-02-05 21:59:47,326 INFO L78 Accepts]: Start accepts. Automaton has 74248 states and 125343 transitions. Word has length 686 [2025-02-05 21:59:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 74248 states and 125343 transitions. [2025-02-05 21:59:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 74248 states and 125343 transitions. [2025-02-05 21:59:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 21:59:47,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:47,375 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:59:47,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1335073441, now seen corresponding path program 1 times [2025-02-05 21:59:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571960001] [2025-02-05 21:59:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:47,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 21:59:47,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 21:59:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571960001] [2025-02-05 21:59:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571960001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:59:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506713160] [2025-02-05 21:59:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:59:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:48,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:59:48,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:59:48,494 INFO L87 Difference]: Start difference. First operand 74248 states and 125343 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,019 INFO L93 Difference]: Finished difference Result 206164 states and 347436 transitions. [2025-02-05 21:59:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:59:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 686 [2025-02-05 21:59:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:53,434 INFO L225 Difference]: With dead ends: 206164 [2025-02-05 21:59:53,434 INFO L226 Difference]: Without dead ends: 131976 [2025-02-05 21:59:53,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:59:53,587 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 2380 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:53,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 2791 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:59:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131976 states. [2025-02-05 21:59:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131976 to 98688. [2025-02-05 21:59:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98688 states, 80747 states have (on average 1.6313794939750084) internal successors, (131729), 81248 states have internal predecessors, (131729), 17339 states have call successors, (17339), 601 states have call predecessors, (17339), 601 states have return successors, (17339), 16838 states have call predecessors, (17339), 17339 states have call successors, (17339) [2025-02-05 21:59:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98688 states to 98688 states and 166407 transitions. [2025-02-05 21:59:57,791 INFO L78 Accepts]: Start accepts. Automaton has 98688 states and 166407 transitions. Word has length 686 [2025-02-05 21:59:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:57,791 INFO L471 AbstractCegarLoop]: Abstraction has 98688 states and 166407 transitions. [2025-02-05 21:59:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:59:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 98688 states and 166407 transitions. [2025-02-05 21:59:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 21:59:58,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:58,314 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:59:58,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1640009541, now seen corresponding path program 1 times [2025-02-05 21:59:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544780074] [2025-02-05 21:59:58,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:58,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 21:59:58,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 21:59:58,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:58,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:59:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544780074] [2025-02-05 21:59:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544780074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022490440] [2025-02-05 21:59:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:59,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:59,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:59,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:59,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:59,686 INFO L87 Difference]: Start difference. First operand 98688 states and 166407 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 22:00:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:04,121 INFO L93 Difference]: Finished difference Result 164844 states and 278649 transitions. [2025-02-05 22:00:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:00:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 686 [2025-02-05 22:00:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:04,495 INFO L225 Difference]: With dead ends: 164844 [2025-02-05 22:00:04,496 INFO L226 Difference]: Without dead ends: 114738 [2025-02-05 22:00:04,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:00:04,601 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 764 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:04,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1679 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:00:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114738 states. [2025-02-05 22:00:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114738 to 104088. [2025-02-05 22:00:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104088 states, 85407 states have (on average 1.629948364888124) internal successors, (139209), 85932 states have internal predecessors, (139209), 18055 states have call successors, (18055), 625 states have call predecessors, (18055), 625 states have return successors, (18055), 17530 states have call predecessors, (18055), 18055 states have call successors, (18055) [2025-02-05 22:00:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104088 states to 104088 states and 175319 transitions. [2025-02-05 22:00:10,572 INFO L78 Accepts]: Start accepts. Automaton has 104088 states and 175319 transitions. Word has length 686 [2025-02-05 22:00:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:10,573 INFO L471 AbstractCegarLoop]: Abstraction has 104088 states and 175319 transitions. [2025-02-05 22:00:10,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 22:00:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 104088 states and 175319 transitions. [2025-02-05 22:00:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 22:00:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:10,654 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:00:10,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1605907518, now seen corresponding path program 1 times [2025-02-05 22:00:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731093086] [2025-02-05 22:00:10,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:10,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 22:00:10,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 22:00:10,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:10,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 22:00:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731093086] [2025-02-05 22:00:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731093086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:00:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474434244] [2025-02-05 22:00:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:00:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:11,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:00:11,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:00:11,483 INFO L87 Difference]: Start difference. First operand 104088 states and 175319 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106)