./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.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_variablewrapping_wrapper-ap_file-66.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 d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:30:46,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:30:46,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:30:46,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:30:46,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:30:46,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:30:46,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:30:46,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:30:46,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:30:46,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:30:46,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:30:46,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:30:46,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:30:46,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:30:46,415 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:30:46,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:30:46,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:30:46,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:30:46,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:30:46,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:30:46,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:30:46,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:30:46,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:30:46,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:30:46,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:30:46,418 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 -> d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 [2025-02-06 03:30:46,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:30:46,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:30:46,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:30:46,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:30:46,656 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:30:46,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-02-06 03:30:47,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d121d3bf8/20c48de5433b485289945fbf74d48f42/FLAG34967fabb [2025-02-06 03:30:48,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:30:48,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-02-06 03:30:48,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d121d3bf8/20c48de5433b485289945fbf74d48f42/FLAG34967fabb [2025-02-06 03:30:48,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d121d3bf8/20c48de5433b485289945fbf74d48f42 [2025-02-06 03:30:48,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:30:48,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:30:48,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:30:48,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:30:48,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:30:48,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f06b001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48, skipping insertion in model container [2025-02-06 03:30:48,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:30:48,498 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_variablewrapping_wrapper-ap_file-66.i[917,930] [2025-02-06 03:30:48,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:30:48,553 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:30:48,562 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_variablewrapping_wrapper-ap_file-66.i[917,930] [2025-02-06 03:30:48,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:30:48,616 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:30:48,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48 WrapperNode [2025-02-06 03:30:48,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:30:48,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:30:48,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:30:48,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:30:48,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,653 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-02-06 03:30:48,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:30:48,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:30:48,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:30:48,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:30:48,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,700 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2025-02-06 03:30:48,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:30:48,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:30:48,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:30:48,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:30:48,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (1/1) ... [2025-02-06 03:30:48,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:30:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:48,772 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-06 03:30:48,782 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-06 03:30:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:30:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:30:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:30:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:30:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:30:48,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:30:48,917 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:30:48,919 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:30:49,261 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-02-06 03:30:49,300 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-02-06 03:30:49,300 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:30:49,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:30:49,311 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:30:49,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:30:49 BoogieIcfgContainer [2025-02-06 03:30:49,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:30:49,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:30:49,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:30:49,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:30:49,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:30:48" (1/3) ... [2025-02-06 03:30:49,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e06c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:30:49, skipping insertion in model container [2025-02-06 03:30:49,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:30:48" (2/3) ... [2025-02-06 03:30:49,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e06c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:30:49, skipping insertion in model container [2025-02-06 03:30:49,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:30:49" (3/3) ... [2025-02-06 03:30:49,319 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-66.i [2025-02-06 03:30:49,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:30:49,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:30:49,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:30:49,387 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;@347d71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:30:49,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:30:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:30:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:30:49,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:49,398 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:49,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:49,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1469854672, now seen corresponding path program 1 times [2025-02-06 03:30:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890528596] [2025-02-06 03:30:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:30:49,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:30:49,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:49,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:30:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890528596] [2025-02-06 03:30:49,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890528596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622884454] [2025-02-06 03:30:49,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:49,658 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-06 03:30:49,659 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-06 03:30:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:30:49,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:30:49,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:49,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:30:49,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:30:49,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:30:49,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622884454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:49,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:49,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:30:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642638514] [2025-02-06 03:30:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:30:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:49,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:30:49,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:30:49,924 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:30:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:49,943 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-02-06 03:30:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:30:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-02-06 03:30:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:49,948 INFO L225 Difference]: With dead ends: 164 [2025-02-06 03:30:49,948 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 03:30:49,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-06 03:30:49,952 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:49,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 03:30:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 03:30:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:30:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-02-06 03:30:49,981 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-02-06 03:30:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:49,981 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-02-06 03:30:49,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:30:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-02-06 03:30:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:30:49,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:49,984 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:49,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:30:50,189 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-06 03:30:50,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:50,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1478786114, now seen corresponding path program 1 times [2025-02-06 03:30:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:50,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318763721] [2025-02-06 03:30:50,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:50,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:30:50,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:30:50,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:50,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318763721] [2025-02-06 03:30:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318763721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:50,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:30:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712021051] [2025-02-06 03:30:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:30:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:50,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:30:50,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:30:50,468 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:50,507 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-02-06 03:30:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:30:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-02-06 03:30:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:50,509 INFO L225 Difference]: With dead ends: 164 [2025-02-06 03:30:50,511 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 03:30:50,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:30:50,512 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:50,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 03:30:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-02-06 03:30:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:30:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-02-06 03:30:50,525 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-02-06 03:30:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:50,527 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-02-06 03:30:50,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-02-06 03:30:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:30:50,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:50,530 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:50,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:30:50,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:50,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1928677501, now seen corresponding path program 1 times [2025-02-06 03:30:50,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:50,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74076997] [2025-02-06 03:30:50,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:50,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:30:50,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:30:50,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74076997] [2025-02-06 03:30:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74076997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:30:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273062206] [2025-02-06 03:30:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:30:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:50,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:30:50,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:30:50,711 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:50,734 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2025-02-06 03:30:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:30:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-02-06 03:30:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:50,735 INFO L225 Difference]: With dead ends: 168 [2025-02-06 03:30:50,735 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 03:30:50,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:30:50,736 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:50,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 03:30:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-02-06 03:30:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:30:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-02-06 03:30:50,747 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2025-02-06 03:30:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-02-06 03:30:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-02-06 03:30:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:30:50,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:50,749 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:50,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:30:50,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1927753980, now seen corresponding path program 1 times [2025-02-06 03:30:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984035016] [2025-02-06 03:30:50,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:50,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:30:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:30:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:50,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984035016] [2025-02-06 03:30:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984035016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:30:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776872119] [2025-02-06 03:30:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:30:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:30:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:51,605 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:30:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:51,896 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-02-06 03:30:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 109 [2025-02-06 03:30:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:51,898 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:30:51,899 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 03:30:51,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:30:51,900 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 92 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:51,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 519 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 03:30:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-02-06 03:30:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.323076923076923) internal successors, (172), 130 states have internal predecessors, (172), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:30:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2025-02-06 03:30:51,913 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 109 [2025-02-06 03:30:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:51,913 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2025-02-06 03:30:51,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:30:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2025-02-06 03:30:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:30:51,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:51,915 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:30:51,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -911179747, now seen corresponding path program 1 times [2025-02-06 03:30:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580543542] [2025-02-06 03:30:51,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:30:51,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:30:51,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:51,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580543542] [2025-02-06 03:30:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580543542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:30:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569050501] [2025-02-06 03:30:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:30:52,301 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:52,535 INFO L93 Difference]: Finished difference Result 356 states and 498 transitions. [2025-02-06 03:30:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-02-06 03:30:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:52,538 INFO L225 Difference]: With dead ends: 356 [2025-02-06 03:30:52,538 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 03:30:52,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:52,539 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 186 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:52,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 353 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 03:30:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 220. [2025-02-06 03:30:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 185 states have internal predecessors, (244), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:30:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 308 transitions. [2025-02-06 03:30:52,564 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 308 transitions. Word has length 110 [2025-02-06 03:30:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:52,565 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 308 transitions. [2025-02-06 03:30:52,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 308 transitions. [2025-02-06 03:30:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:30:52,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:52,569 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:52,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:30:52,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2030477852, now seen corresponding path program 1 times [2025-02-06 03:30:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700600963] [2025-02-06 03:30:52,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:52,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:30:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:30:52,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:52,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700600963] [2025-02-06 03:30:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700600963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:30:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194522035] [2025-02-06 03:30:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:54,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:30:54,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:54,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:30:54,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:30:54,890 INFO L87 Difference]: Start difference. First operand 220 states and 308 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:30:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:56,149 INFO L93 Difference]: Finished difference Result 738 states and 1041 transitions. [2025-02-06 03:30:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:30:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2025-02-06 03:30:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:56,153 INFO L225 Difference]: With dead ends: 738 [2025-02-06 03:30:56,153 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 03:30:56,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:30:56,155 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 560 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:56,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 480 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:30:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 03:30:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 258. [2025-02-06 03:30:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 208 states have (on average 1.3125) internal successors, (273), 210 states have internal predecessors, (273), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:30:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 361 transitions. [2025-02-06 03:30:56,214 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 361 transitions. Word has length 110 [2025-02-06 03:30:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:56,214 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 361 transitions. [2025-02-06 03:30:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:30:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 361 transitions. [2025-02-06 03:30:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:30:56,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:56,216 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:30:56,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:56,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1737074845, now seen corresponding path program 1 times [2025-02-06 03:30:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921249253] [2025-02-06 03:30:56,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:30:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:30:56,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:56,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921249253] [2025-02-06 03:30:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921249253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:30:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735297057] [2025-02-06 03:30:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:56,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:30:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:56,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:30:56,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:30:56,764 INFO L87 Difference]: Start difference. First operand 258 states and 361 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:30:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:57,031 INFO L93 Difference]: Finished difference Result 523 states and 727 transitions. [2025-02-06 03:30:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:30:57,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-02-06 03:30:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:57,033 INFO L225 Difference]: With dead ends: 523 [2025-02-06 03:30:57,033 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 03:30:57,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:30:57,034 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 336 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 343 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 03:30:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 223. [2025-02-06 03:30:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 188 states have (on average 1.3297872340425532) internal successors, (250), 189 states have internal predecessors, (250), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:30:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 310 transitions. [2025-02-06 03:30:57,053 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 310 transitions. Word has length 110 [2025-02-06 03:30:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 310 transitions. [2025-02-06 03:30:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:30:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 310 transitions. [2025-02-06 03:30:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:30:57,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:57,054 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:30:57,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 510456538, now seen corresponding path program 1 times [2025-02-06 03:30:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964827736] [2025-02-06 03:30:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:30:57,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:30:57,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:57,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:30:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964827736] [2025-02-06 03:30:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964827736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166052116] [2025-02-06 03:30:57,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:57,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:30:57,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:30:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:30:57,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:30:57,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:57,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:57,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:30:57,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:57,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:30:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166052116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:30:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347468074] [2025-02-06 03:30:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:57,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:57,332 INFO L87 Difference]: Start difference. First operand 223 states and 310 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:57,374 INFO L93 Difference]: Finished difference Result 452 states and 629 transitions. [2025-02-06 03:30:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-02-06 03:30:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:57,376 INFO L225 Difference]: With dead ends: 452 [2025-02-06 03:30:57,376 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 03:30:57,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:57,377 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:57,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 03:30:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-06 03:30:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 198 states have internal predecessors, (259), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:30:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2025-02-06 03:30:57,409 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 113 [2025-02-06 03:30:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:57,410 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2025-02-06 03:30:57,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:30:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2025-02-06 03:30:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:30:57,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:57,411 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:57,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:30:57,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:57,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:57,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -124147616, now seen corresponding path program 1 times [2025-02-06 03:30:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555933363] [2025-02-06 03:30:57,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:57,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:30:57,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:30:57,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:57,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555933363] [2025-02-06 03:30:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555933363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:30:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955619184] [2025-02-06 03:30:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:30:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:58,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:30:58,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:30:58,354 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:30:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:59,147 INFO L93 Difference]: Finished difference Result 609 states and 831 transitions. [2025-02-06 03:30:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:30:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-02-06 03:30:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:59,150 INFO L225 Difference]: With dead ends: 609 [2025-02-06 03:30:59,150 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 03:30:59,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:30:59,151 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 719 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:59,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 655 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:30:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 03:30:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 323. [2025-02-06 03:30:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:30:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 445 transitions. [2025-02-06 03:30:59,189 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 445 transitions. Word has length 113 [2025-02-06 03:30:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:59,189 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 445 transitions. [2025-02-06 03:30:59,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:30:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 445 transitions. [2025-02-06 03:30:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:30:59,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:59,190 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:59,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:30:59,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash -417550623, now seen corresponding path program 1 times [2025-02-06 03:30:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229130426] [2025-02-06 03:30:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:59,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:30:59,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:30:59,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:59,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:30:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229130426] [2025-02-06 03:30:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229130426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:30:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961933246] [2025-02-06 03:30:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:30:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:59,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:30:59,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:30:59,708 INFO L87 Difference]: Start difference. First operand 323 states and 445 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:00,046 INFO L93 Difference]: Finished difference Result 691 states and 950 transitions. [2025-02-06 03:31:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-02-06 03:31:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:00,049 INFO L225 Difference]: With dead ends: 691 [2025-02-06 03:31:00,049 INFO L226 Difference]: Without dead ends: 453 [2025-02-06 03:31:00,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:31:00,050 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 240 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:00,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 725 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-06 03:31:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 372. [2025-02-06 03:31:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 316 states have internal predecessors, (407), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:31:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 507 transitions. [2025-02-06 03:31:00,097 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 507 transitions. Word has length 113 [2025-02-06 03:31:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:00,098 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 507 transitions. [2025-02-06 03:31:00,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 507 transitions. [2025-02-06 03:31:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:31:00,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:00,099 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:31:00,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:00,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash 87203297, now seen corresponding path program 1 times [2025-02-06 03:31:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:00,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584102629] [2025-02-06 03:31:00,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:00,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:31:00,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:31:00,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:00,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584102629] [2025-02-06 03:31:00,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584102629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:00,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:00,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:31:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563237908] [2025-02-06 03:31:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:00,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:31:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:00,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:31:00,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:31:00,775 INFO L87 Difference]: Start difference. First operand 372 states and 507 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:01,284 INFO L93 Difference]: Finished difference Result 661 states and 899 transitions. [2025-02-06 03:31:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-02-06 03:31:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:01,287 INFO L225 Difference]: With dead ends: 661 [2025-02-06 03:31:01,289 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 03:31:01,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:31:01,290 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 358 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:01,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 445 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:31:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 03:31:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 246. [2025-02-06 03:31:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 201 states have (on average 1.2686567164179106) internal successors, (255), 202 states have internal predecessors, (255), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 03:31:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 331 transitions. [2025-02-06 03:31:01,336 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 331 transitions. Word has length 113 [2025-02-06 03:31:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 331 transitions. [2025-02-06 03:31:01,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2025-02-06 03:31:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:31:01,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:01,338 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:01,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:31:01,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 623297436, now seen corresponding path program 1 times [2025-02-06 03:31:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306957165] [2025-02-06 03:31:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:01,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:31:01,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:31:01,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:01,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306957165] [2025-02-06 03:31:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306957165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:31:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533670690] [2025-02-06 03:31:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:31:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:01,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:31:01,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:31:01,550 INFO L87 Difference]: Start difference. First operand 246 states and 331 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:01,798 INFO L93 Difference]: Finished difference Result 755 states and 1024 transitions. [2025-02-06 03:31:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-02-06 03:31:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:01,801 INFO L225 Difference]: With dead ends: 755 [2025-02-06 03:31:01,801 INFO L226 Difference]: Without dead ends: 512 [2025-02-06 03:31:01,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:31:01,802 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 146 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:01,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 367 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-06 03:31:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 331. [2025-02-06 03:31:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 270 states have (on average 1.2740740740740741) internal successors, (344), 271 states have internal predecessors, (344), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2025-02-06 03:31:01,865 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 115 [2025-02-06 03:31:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:01,865 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2025-02-06 03:31:01,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2025-02-06 03:31:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:31:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:01,870 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:31:01,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1509681494, now seen corresponding path program 1 times [2025-02-06 03:31:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118709380] [2025-02-06 03:31:01,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:01,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:31:01,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:31:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118709380] [2025-02-06 03:31:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118709380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:31:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122730634] [2025-02-06 03:31:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:31:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:02,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:31:02,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:31:02,736 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:31:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:03,516 INFO L93 Difference]: Finished difference Result 665 states and 903 transitions. [2025-02-06 03:31:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:31:03,517 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 115 [2025-02-06 03:31:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:03,519 INFO L225 Difference]: With dead ends: 665 [2025-02-06 03:31:03,519 INFO L226 Difference]: Without dead ends: 422 [2025-02-06 03:31:03,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:31:03,520 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 336 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:03,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 638 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:31:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-06 03:31:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 362. [2025-02-06 03:31:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 301 states have (on average 1.282392026578073) internal successors, (386), 302 states have internal predecessors, (386), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 490 transitions. [2025-02-06 03:31:03,556 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 490 transitions. Word has length 115 [2025-02-06 03:31:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 490 transitions. [2025-02-06 03:31:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:31:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 490 transitions. [2025-02-06 03:31:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:31:03,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:03,557 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:31:03,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:03,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2130849245, now seen corresponding path program 1 times [2025-02-06 03:31:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502291425] [2025-02-06 03:31:03,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:31:03,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:31:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:03,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502291425] [2025-02-06 03:31:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502291425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:31:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848808357] [2025-02-06 03:31:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:03,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:31:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:31:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:31:03,825 INFO L87 Difference]: Start difference. First operand 362 states and 490 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:04,204 INFO L93 Difference]: Finished difference Result 600 states and 810 transitions. [2025-02-06 03:31:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:31:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-02-06 03:31:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:04,206 INFO L225 Difference]: With dead ends: 600 [2025-02-06 03:31:04,206 INFO L226 Difference]: Without dead ends: 439 [2025-02-06 03:31:04,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:31:04,207 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 161 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:04,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 564 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:31:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-06 03:31:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 393. [2025-02-06 03:31:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2981927710843373) internal successors, (431), 333 states have internal predecessors, (431), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 535 transitions. [2025-02-06 03:31:04,242 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 535 transitions. Word has length 115 [2025-02-06 03:31:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:04,242 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 535 transitions. [2025-02-06 03:31:04,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 535 transitions. [2025-02-06 03:31:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:31:04,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:04,243 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:31:04,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -959316212, now seen corresponding path program 1 times [2025-02-06 03:31:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705827963] [2025-02-06 03:31:04,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:31:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:31:04,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:04,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:04,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705827963] [2025-02-06 03:31:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705827963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:31:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39767600] [2025-02-06 03:31:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:31:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:31:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:31:04,553 INFO L87 Difference]: Start difference. First operand 393 states and 535 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:04,734 INFO L93 Difference]: Finished difference Result 691 states and 940 transitions. [2025-02-06 03:31:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:31:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-02-06 03:31:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:04,736 INFO L225 Difference]: With dead ends: 691 [2025-02-06 03:31:04,736 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 03:31:04,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:31:04,737 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 152 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 342 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:31:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 03:31:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2025-02-06 03:31:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2951807228915662) internal successors, (430), 333 states have internal predecessors, (430), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 534 transitions. [2025-02-06 03:31:04,779 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 534 transitions. Word has length 116 [2025-02-06 03:31:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 534 transitions. [2025-02-06 03:31:04,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 534 transitions. [2025-02-06 03:31:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:31:04,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:04,781 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:04,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:31:04,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -338148461, now seen corresponding path program 1 times [2025-02-06 03:31:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300782531] [2025-02-06 03:31:04,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:31:04,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:31:04,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300782531] [2025-02-06 03:31:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300782531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:31:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134009449] [2025-02-06 03:31:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:05,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:31:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:05,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:31:05,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:31:05,144 INFO L87 Difference]: Start difference. First operand 393 states and 534 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:05,550 INFO L93 Difference]: Finished difference Result 787 states and 1065 transitions. [2025-02-06 03:31:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:05,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2025-02-06 03:31:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:05,554 INFO L225 Difference]: With dead ends: 787 [2025-02-06 03:31:05,554 INFO L226 Difference]: Without dead ends: 491 [2025-02-06 03:31:05,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:31:05,555 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:05,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 532 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:31:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-06 03:31:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 393. [2025-02-06 03:31:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2921686746987953) internal successors, (429), 333 states have internal predecessors, (429), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 533 transitions. [2025-02-06 03:31:05,597 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 533 transitions. Word has length 116 [2025-02-06 03:31:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 533 transitions. [2025-02-06 03:31:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 533 transitions. [2025-02-06 03:31:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:31:05,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:05,599 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:31:05,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -366055527, now seen corresponding path program 1 times [2025-02-06 03:31:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404971122] [2025-02-06 03:31:05,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:05,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:31:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:31:05,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:05,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404971122] [2025-02-06 03:31:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404971122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:07,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 03:31:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360788412] [2025-02-06 03:31:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:31:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:31:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:31:07,145 INFO L87 Difference]: Start difference. First operand 393 states and 533 transitions. Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 03:31:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:08,550 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2025-02-06 03:31:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:31:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 117 [2025-02-06 03:31:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:08,553 INFO L225 Difference]: With dead ends: 503 [2025-02-06 03:31:08,553 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 03:31:08,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:31:08,554 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 670 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:08,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 654 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:31:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 03:31:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 438. [2025-02-06 03:31:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 378 states have internal predecessors, (488), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 592 transitions. [2025-02-06 03:31:08,590 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 592 transitions. Word has length 117 [2025-02-06 03:31:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:08,590 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 592 transitions. [2025-02-06 03:31:08,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 03:31:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 592 transitions. [2025-02-06 03:31:08,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:31:08,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:08,591 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:08,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:31:08,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash -365132006, now seen corresponding path program 1 times [2025-02-06 03:31:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097694579] [2025-02-06 03:31:08,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:31:08,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:31:08,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:08,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097694579] [2025-02-06 03:31:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097694579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:31:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430989359] [2025-02-06 03:31:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:31:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:09,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:31:09,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:31:09,501 INFO L87 Difference]: Start difference. First operand 438 states and 592 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:11,049 INFO L93 Difference]: Finished difference Result 1013 states and 1362 transitions. [2025-02-06 03:31:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:31:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2025-02-06 03:31:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:11,053 INFO L225 Difference]: With dead ends: 1013 [2025-02-06 03:31:11,053 INFO L226 Difference]: Without dead ends: 679 [2025-02-06 03:31:11,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:31:11,054 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 486 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:11,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1114 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:31:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-06 03:31:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 504. [2025-02-06 03:31:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 443 states have (on average 1.3115124153498872) internal successors, (581), 444 states have internal predecessors, (581), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 685 transitions. [2025-02-06 03:31:11,125 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 685 transitions. Word has length 117 [2025-02-06 03:31:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:11,125 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 685 transitions. [2025-02-06 03:31:11,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 685 transitions. [2025-02-06 03:31:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:31:11,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:11,127 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:11,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:31:11,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 522371675, now seen corresponding path program 1 times [2025-02-06 03:31:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450865069] [2025-02-06 03:31:11,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:11,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:31:11,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:31:11,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:11,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:31:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450865069] [2025-02-06 03:31:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450865069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:31:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798634090] [2025-02-06 03:31:11,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:31:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:31:11,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:31:11,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:31:11,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:31:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:31:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:11,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-06 03:31:11,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:31:12,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:31:12,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:31:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:31:12,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:31:12,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:31:13,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:31:13,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:31:13,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:31:13,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:31:13,888 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-06 03:31:13,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-02-06 03:31:13,984 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-06 03:31:13,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-02-06 03:31:14,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:31:14,107 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2025-02-06 03:31:14,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2025-02-06 03:31:14,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:31:14,378 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-02-06 03:31:14,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 51 [2025-02-06 03:31:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 76 proven. 239 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-06 03:31:14,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:31:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798634090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:31:22,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:31:22,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2025-02-06 03:31:22,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955666677] [2025-02-06 03:31:22,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:31:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 03:31:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:22,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 03:31:22,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2025-02-06 03:31:22,903 INFO L87 Difference]: Start difference. First operand 504 states and 685 transitions. Second operand has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2025-02-06 03:31:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:27,675 INFO L93 Difference]: Finished difference Result 964 states and 1275 transitions. [2025-02-06 03:31:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 03:31:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) Word has length 117 [2025-02-06 03:31:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:27,679 INFO L225 Difference]: With dead ends: 964 [2025-02-06 03:31:27,679 INFO L226 Difference]: Without dead ends: 659 [2025-02-06 03:31:27,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=686, Invalid=2392, Unknown=2, NotChecked=0, Total=3080 [2025-02-06 03:31:27,681 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 756 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 184 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:27,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 620 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1127 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 03:31:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-06 03:31:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 464. [2025-02-06 03:31:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 396 states have (on average 1.2676767676767677) internal successors, (502), 397 states have internal predecessors, (502), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 606 transitions. [2025-02-06 03:31:27,759 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 606 transitions. Word has length 117 [2025-02-06 03:31:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:27,760 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 606 transitions. [2025-02-06 03:31:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2025-02-06 03:31:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 606 transitions. [2025-02-06 03:31:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:27,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:27,761 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:27,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:31:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:31:27,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:27,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 427911894, now seen corresponding path program 1 times [2025-02-06 03:31:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502792407] [2025-02-06 03:31:27,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:27,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:28,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502792407] [2025-02-06 03:31:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502792407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:31:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988090522] [2025-02-06 03:31:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:28,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:31:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:28,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:31:28,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:31:28,569 INFO L87 Difference]: Start difference. First operand 464 states and 606 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:29,176 INFO L93 Difference]: Finished difference Result 659 states and 860 transitions. [2025-02-06 03:31:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-02-06 03:31:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:29,178 INFO L225 Difference]: With dead ends: 659 [2025-02-06 03:31:29,179 INFO L226 Difference]: Without dead ends: 464 [2025-02-06 03:31:29,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:31:29,180 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 197 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:29,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 261 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:31:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-02-06 03:31:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-02-06 03:31:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 396 states have (on average 1.2575757575757576) internal successors, (498), 397 states have internal predecessors, (498), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 602 transitions. [2025-02-06 03:31:29,274 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 602 transitions. Word has length 119 [2025-02-06 03:31:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 602 transitions. [2025-02-06 03:31:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 602 transitions. [2025-02-06 03:31:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:29,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:29,276 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:29,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:31:29,276 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:29,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2100031199, now seen corresponding path program 1 times [2025-02-06 03:31:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055584897] [2025-02-06 03:31:29,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:29,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:29,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:29,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:29,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:29,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055584897] [2025-02-06 03:31:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055584897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:31:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662516695] [2025-02-06 03:31:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:29,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:31:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:29,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:31:29,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:31:29,519 INFO L87 Difference]: Start difference. First operand 464 states and 602 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:29,914 INFO L93 Difference]: Finished difference Result 913 states and 1191 transitions. [2025-02-06 03:31:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:29,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-06 03:31:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:29,917 INFO L225 Difference]: With dead ends: 913 [2025-02-06 03:31:29,917 INFO L226 Difference]: Without dead ends: 553 [2025-02-06 03:31:29,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:31:29,918 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 194 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:29,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 477 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:31:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-06 03:31:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 484. [2025-02-06 03:31:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 416 states have (on average 1.2572115384615385) internal successors, (523), 417 states have internal predecessors, (523), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 627 transitions. [2025-02-06 03:31:29,974 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 627 transitions. Word has length 119 [2025-02-06 03:31:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:29,974 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 627 transitions. [2025-02-06 03:31:29,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 627 transitions. [2025-02-06 03:31:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:29,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:29,975 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:31:29,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -55538051, now seen corresponding path program 1 times [2025-02-06 03:31:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208851703] [2025-02-06 03:31:29,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:29,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:29,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:29,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:29,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208851703] [2025-02-06 03:31:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208851703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:31:30,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748495943] [2025-02-06 03:31:30,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:31:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:30,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:31:30,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:31:30,263 INFO L87 Difference]: Start difference. First operand 484 states and 627 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:30,856 INFO L93 Difference]: Finished difference Result 599 states and 774 transitions. [2025-02-06 03:31:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:30,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:31:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:30,858 INFO L225 Difference]: With dead ends: 599 [2025-02-06 03:31:30,858 INFO L226 Difference]: Without dead ends: 597 [2025-02-06 03:31:30,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:31:30,860 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:30,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 505 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:31:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-06 03:31:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 559. [2025-02-06 03:31:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 491 states have (on average 1.2729124236252545) internal successors, (625), 492 states have internal predecessors, (625), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2025-02-06 03:31:30,939 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 119 [2025-02-06 03:31:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:30,939 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2025-02-06 03:31:30,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2025-02-06 03:31:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:30,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:30,940 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:31:30,941 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:30,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 832889151, now seen corresponding path program 1 times [2025-02-06 03:31:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054893130] [2025-02-06 03:31:30,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:30,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:30,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:30,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054893130] [2025-02-06 03:31:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054893130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:31,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:31:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660225977] [2025-02-06 03:31:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:31,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:31:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:31,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:31:31,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:31:31,448 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:32,365 INFO L93 Difference]: Finished difference Result 1126 states and 1465 transitions. [2025-02-06 03:31:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-06 03:31:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:32,368 INFO L225 Difference]: With dead ends: 1126 [2025-02-06 03:31:32,368 INFO L226 Difference]: Without dead ends: 672 [2025-02-06 03:31:32,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:31:32,369 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 372 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:32,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 833 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:31:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-02-06 03:31:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 591. [2025-02-06 03:31:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 523 states have (on average 1.27151051625239) internal successors, (665), 524 states have internal predecessors, (665), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 769 transitions. [2025-02-06 03:31:32,442 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 769 transitions. Word has length 119 [2025-02-06 03:31:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:32,442 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 769 transitions. [2025-02-06 03:31:32,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 769 transitions. [2025-02-06 03:31:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:32,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:32,443 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:31:32,443 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -964062208, now seen corresponding path program 1 times [2025-02-06 03:31:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791388101] [2025-02-06 03:31:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:32,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:32,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:32,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:32,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:32,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791388101] [2025-02-06 03:31:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791388101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:32,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:31:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893776485] [2025-02-06 03:31:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:31:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:32,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:31:32,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:31:32,735 INFO L87 Difference]: Start difference. First operand 591 states and 769 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:33,116 INFO L93 Difference]: Finished difference Result 1202 states and 1571 transitions. [2025-02-06 03:31:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:31:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:33,118 INFO L225 Difference]: With dead ends: 1202 [2025-02-06 03:31:33,118 INFO L226 Difference]: Without dead ends: 721 [2025-02-06 03:31:33,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:31:33,120 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 328 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:33,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 694 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-06 03:31:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 655. [2025-02-06 03:31:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 587 states have (on average 1.2759795570698467) internal successors, (749), 588 states have internal predecessors, (749), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 853 transitions. [2025-02-06 03:31:33,180 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 853 transitions. Word has length 119 [2025-02-06 03:31:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:33,180 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 853 transitions. [2025-02-06 03:31:33,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 853 transitions. [2025-02-06 03:31:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:31:33,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:33,181 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:33,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:31:33,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:33,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:33,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653632, now seen corresponding path program 1 times [2025-02-06 03:31:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:33,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097229992] [2025-02-06 03:31:33,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:33,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:31:33,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:31:33,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:33,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097229992] [2025-02-06 03:31:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097229992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:31:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772839604] [2025-02-06 03:31:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:31:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:33,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:31:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:31:33,503 INFO L87 Difference]: Start difference. First operand 655 states and 853 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:33,960 INFO L93 Difference]: Finished difference Result 1274 states and 1657 transitions. [2025-02-06 03:31:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:31:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:33,964 INFO L225 Difference]: With dead ends: 1274 [2025-02-06 03:31:33,964 INFO L226 Difference]: Without dead ends: 709 [2025-02-06 03:31:33,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:31:33,966 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 166 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:33,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 574 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-06 03:31:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 653. [2025-02-06 03:31:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 585 states have (on average 1.2683760683760683) internal successors, (742), 586 states have internal predecessors, (742), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 846 transitions. [2025-02-06 03:31:34,030 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 846 transitions. Word has length 119 [2025-02-06 03:31:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:34,031 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 846 transitions. [2025-02-06 03:31:34,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 846 transitions. [2025-02-06 03:31:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:34,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:34,033 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:34,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:31:34,033 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:34,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -756034376, now seen corresponding path program 1 times [2025-02-06 03:31:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28262396] [2025-02-06 03:31:34,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:34,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:34,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:34,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28262396] [2025-02-06 03:31:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28262396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:31:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387687628] [2025-02-06 03:31:34,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:34,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:31:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:34,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:31:34,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:31:34,545 INFO L87 Difference]: Start difference. First operand 653 states and 846 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:34,886 INFO L93 Difference]: Finished difference Result 1286 states and 1685 transitions. [2025-02-06 03:31:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-02-06 03:31:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:34,889 INFO L225 Difference]: With dead ends: 1286 [2025-02-06 03:31:34,889 INFO L226 Difference]: Without dead ends: 912 [2025-02-06 03:31:34,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:31:34,890 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 346 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:34,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 503 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-02-06 03:31:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 703. [2025-02-06 03:31:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 635 states have (on average 1.2519685039370079) internal successors, (795), 636 states have internal predecessors, (795), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 899 transitions. [2025-02-06 03:31:34,966 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 899 transitions. Word has length 120 [2025-02-06 03:31:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:34,967 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 899 transitions. [2025-02-06 03:31:34,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:31:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 899 transitions. [2025-02-06 03:31:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:34,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:34,967 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:34,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:31:34,968 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:34,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1753106729, now seen corresponding path program 1 times [2025-02-06 03:31:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570507568] [2025-02-06 03:31:34,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:34,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:34,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570507568] [2025-02-06 03:31:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570507568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:31:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565377714] [2025-02-06 03:31:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:35,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:31:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:35,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:31:35,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:31:35,087 INFO L87 Difference]: Start difference. First operand 703 states and 899 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:35,300 INFO L93 Difference]: Finished difference Result 1439 states and 1846 transitions. [2025-02-06 03:31:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:31:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-02-06 03:31:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:35,305 INFO L225 Difference]: With dead ends: 1439 [2025-02-06 03:31:35,305 INFO L226 Difference]: Without dead ends: 875 [2025-02-06 03:31:35,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:31:35,307 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 29 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:35,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 383 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:31:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-06 03:31:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 700. [2025-02-06 03:31:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 632 states have (on average 1.2325949367088607) internal successors, (779), 633 states have internal predecessors, (779), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 883 transitions. [2025-02-06 03:31:35,378 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 883 transitions. Word has length 120 [2025-02-06 03:31:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:35,378 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 883 transitions. [2025-02-06 03:31:35,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 883 transitions. [2025-02-06 03:31:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:35,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:35,379 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:35,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:31:35,380 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash -823041129, now seen corresponding path program 1 times [2025-02-06 03:31:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364964791] [2025-02-06 03:31:35,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:35,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:35,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:35,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:35,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:35,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:35,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364964791] [2025-02-06 03:31:35,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364964791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:35,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:35,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:31:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175618116] [2025-02-06 03:31:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:31:35,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:35,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:31:35,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:31:35,946 INFO L87 Difference]: Start difference. First operand 700 states and 883 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:36,725 INFO L93 Difference]: Finished difference Result 1036 states and 1306 transitions. [2025-02-06 03:31:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:31:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-02-06 03:31:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:36,728 INFO L225 Difference]: With dead ends: 1036 [2025-02-06 03:31:36,728 INFO L226 Difference]: Without dead ends: 712 [2025-02-06 03:31:36,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:31:36,729 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 391 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:36,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 557 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:31:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-02-06 03:31:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 667. [2025-02-06 03:31:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 599 states have (on average 1.2270450751252087) internal successors, (735), 600 states have internal predecessors, (735), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 839 transitions. [2025-02-06 03:31:36,807 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 839 transitions. Word has length 120 [2025-02-06 03:31:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 839 transitions. [2025-02-06 03:31:36,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2025-02-06 03:31:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:36,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:36,808 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:31:36,808 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2065638475, now seen corresponding path program 1 times [2025-02-06 03:31:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646061427] [2025-02-06 03:31:36,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:36,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:36,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:36,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646061427] [2025-02-06 03:31:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646061427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:31:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364401138] [2025-02-06 03:31:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:31:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:37,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:31:37,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:31:37,037 INFO L87 Difference]: Start difference. First operand 667 states and 839 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:37,512 INFO L93 Difference]: Finished difference Result 1052 states and 1317 transitions. [2025-02-06 03:31:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:31:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-02-06 03:31:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:37,516 INFO L225 Difference]: With dead ends: 1052 [2025-02-06 03:31:37,517 INFO L226 Difference]: Without dead ends: 724 [2025-02-06 03:31:37,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:31:37,518 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 673 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:31:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-06 03:31:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 655. [2025-02-06 03:31:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 587 states have (on average 1.2282793867120954) internal successors, (721), 588 states have internal predecessors, (721), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 825 transitions. [2025-02-06 03:31:37,595 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 825 transitions. Word has length 120 [2025-02-06 03:31:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:37,595 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 825 transitions. [2025-02-06 03:31:37,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 825 transitions. [2025-02-06 03:31:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:37,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:37,596 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:37,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:31:37,597 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1854287562, now seen corresponding path program 1 times [2025-02-06 03:31:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144058799] [2025-02-06 03:31:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:37,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:37,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:37,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:37,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144058799] [2025-02-06 03:31:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144058799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:31:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217025462] [2025-02-06 03:31:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:38,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:31:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:31:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:31:38,459 INFO L87 Difference]: Start difference. First operand 655 states and 825 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:39,630 INFO L93 Difference]: Finished difference Result 1111 states and 1392 transitions. [2025-02-06 03:31:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:31:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-02-06 03:31:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:39,633 INFO L225 Difference]: With dead ends: 1111 [2025-02-06 03:31:39,633 INFO L226 Difference]: Without dead ends: 795 [2025-02-06 03:31:39,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:31:39,635 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 223 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:39,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 742 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:31:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-06 03:31:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 679. [2025-02-06 03:31:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 611 states have (on average 1.2242225859247136) internal successors, (748), 612 states have internal predecessors, (748), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 852 transitions. [2025-02-06 03:31:39,738 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 852 transitions. Word has length 120 [2025-02-06 03:31:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 852 transitions. [2025-02-06 03:31:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 852 transitions. [2025-02-06 03:31:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:31:39,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:39,739 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:31:39,740 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:39,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2109024107, now seen corresponding path program 1 times [2025-02-06 03:31:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039486770] [2025-02-06 03:31:39,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:39,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:31:39,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:31:39,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:39,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039486770] [2025-02-06 03:31:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039486770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:40,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:40,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:31:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847974800] [2025-02-06 03:31:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:40,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:31:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:40,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:31:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:31:40,217 INFO L87 Difference]: Start difference. First operand 679 states and 852 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:41,012 INFO L93 Difference]: Finished difference Result 1056 states and 1322 transitions. [2025-02-06 03:31:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-02-06 03:31:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:41,015 INFO L225 Difference]: With dead ends: 1056 [2025-02-06 03:31:41,015 INFO L226 Difference]: Without dead ends: 740 [2025-02-06 03:31:41,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:31:41,016 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 236 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:41,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 610 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:31:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-06 03:31:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 651. [2025-02-06 03:31:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 583 states have (on average 1.2264150943396226) internal successors, (715), 584 states have internal predecessors, (715), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 819 transitions. [2025-02-06 03:31:41,076 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 819 transitions. Word has length 120 [2025-02-06 03:31:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:41,076 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 819 transitions. [2025-02-06 03:31:41,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 819 transitions. [2025-02-06 03:31:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:31:41,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:41,077 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:41,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:31:41,077 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:41,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1570072885, now seen corresponding path program 1 times [2025-02-06 03:31:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:41,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370207478] [2025-02-06 03:31:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:41,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:31:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:31:41,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:41,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370207478] [2025-02-06 03:31:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370207478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:41,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:31:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697472391] [2025-02-06 03:31:41,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:41,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:31:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:41,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:31:41,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:31:41,270 INFO L87 Difference]: Start difference. First operand 651 states and 819 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:41,537 INFO L93 Difference]: Finished difference Result 1207 states and 1512 transitions. [2025-02-06 03:31:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:31:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-02-06 03:31:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:41,540 INFO L225 Difference]: With dead ends: 1207 [2025-02-06 03:31:41,540 INFO L226 Difference]: Without dead ends: 921 [2025-02-06 03:31:41,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:31:41,541 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 44 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:41,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 579 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-02-06 03:31:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 808. [2025-02-06 03:31:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 740 states have (on average 1.218918918918919) internal successors, (902), 741 states have internal predecessors, (902), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1006 transitions. [2025-02-06 03:31:41,602 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1006 transitions. Word has length 122 [2025-02-06 03:31:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1006 transitions. [2025-02-06 03:31:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1006 transitions. [2025-02-06 03:31:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:31:41,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:41,603 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:41,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:31:41,604 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:41,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 676158044, now seen corresponding path program 1 times [2025-02-06 03:31:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694941429] [2025-02-06 03:31:41,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:41,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:31:41,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:31:41,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:41,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694941429] [2025-02-06 03:31:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694941429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:31:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578405195] [2025-02-06 03:31:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:42,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:31:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:42,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:31:42,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:31:42,504 INFO L87 Difference]: Start difference. First operand 808 states and 1006 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:44,170 INFO L93 Difference]: Finished difference Result 1565 states and 1958 transitions. [2025-02-06 03:31:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:31:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-02-06 03:31:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:44,174 INFO L225 Difference]: With dead ends: 1565 [2025-02-06 03:31:44,176 INFO L226 Difference]: Without dead ends: 1179 [2025-02-06 03:31:44,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:31:44,177 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 257 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:44,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 928 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:31:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-02-06 03:31:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 919. [2025-02-06 03:31:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 851 states have (on average 1.2244418331374853) internal successors, (1042), 852 states have internal predecessors, (1042), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1146 transitions. [2025-02-06 03:31:44,268 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1146 transitions. Word has length 123 [2025-02-06 03:31:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1146 transitions. [2025-02-06 03:31:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1146 transitions. [2025-02-06 03:31:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:44,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:44,273 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:31:44,273 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash 607977337, now seen corresponding path program 1 times [2025-02-06 03:31:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040055554] [2025-02-06 03:31:44,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:44,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:44,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:44,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:44,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040055554] [2025-02-06 03:31:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040055554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 03:31:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083244016] [2025-02-06 03:31:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:46,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:31:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:46,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:31:46,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:31:46,521 INFO L87 Difference]: Start difference. First operand 919 states and 1146 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:50,151 INFO L93 Difference]: Finished difference Result 1735 states and 2177 transitions. [2025-02-06 03:31:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:31:50,152 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:31:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:50,155 INFO L225 Difference]: With dead ends: 1735 [2025-02-06 03:31:50,160 INFO L226 Difference]: Without dead ends: 1286 [2025-02-06 03:31:50,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:31:50,162 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 602 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:50,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 803 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 03:31:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-06 03:31:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 970. [2025-02-06 03:31:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 902 states have (on average 1.229490022172949) internal successors, (1109), 903 states have internal predecessors, (1109), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1213 transitions. [2025-02-06 03:31:50,252 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1213 transitions. Word has length 125 [2025-02-06 03:31:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:50,252 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1213 transitions. [2025-02-06 03:31:50,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1213 transitions. [2025-02-06 03:31:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:50,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:50,253 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:50,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:31:50,254 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1961287034, now seen corresponding path program 1 times [2025-02-06 03:31:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016606405] [2025-02-06 03:31:50,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:50,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:50,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:50,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:50,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016606405] [2025-02-06 03:31:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016606405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:31:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900604336] [2025-02-06 03:31:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:31:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:50,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:31:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:31:50,423 INFO L87 Difference]: Start difference. First operand 970 states and 1213 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:50,752 INFO L93 Difference]: Finished difference Result 1669 states and 2099 transitions. [2025-02-06 03:31:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:31:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-02-06 03:31:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:50,756 INFO L225 Difference]: With dead ends: 1669 [2025-02-06 03:31:50,756 INFO L226 Difference]: Without dead ends: 1177 [2025-02-06 03:31:50,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:31:50,757 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 41 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:50,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 400 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:31:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-02-06 03:31:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 990. [2025-02-06 03:31:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 922 states have (on average 1.2386117136659436) internal successors, (1142), 923 states have internal predecessors, (1142), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1246 transitions. [2025-02-06 03:31:50,830 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1246 transitions. Word has length 125 [2025-02-06 03:31:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1246 transitions. [2025-02-06 03:31:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:31:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1246 transitions. [2025-02-06 03:31:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:50,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:50,832 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:31:50,832 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:50,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash -826128453, now seen corresponding path program 1 times [2025-02-06 03:31:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:50,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755777460] [2025-02-06 03:31:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:50,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:50,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755777460] [2025-02-06 03:31:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755777460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:51,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:31:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491254963] [2025-02-06 03:31:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:31:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:31:51,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:31:51,952 INFO L87 Difference]: Start difference. First operand 990 states and 1246 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:52,960 INFO L93 Difference]: Finished difference Result 1926 states and 2432 transitions. [2025-02-06 03:31:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:31:52,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:31:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:52,964 INFO L225 Difference]: With dead ends: 1926 [2025-02-06 03:31:52,964 INFO L226 Difference]: Without dead ends: 1394 [2025-02-06 03:31:52,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:31:52,965 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 259 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:52,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 491 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:31:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-02-06 03:31:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1113. [2025-02-06 03:31:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1045 states have (on average 1.2334928229665072) internal successors, (1289), 1046 states have internal predecessors, (1289), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1393 transitions. [2025-02-06 03:31:53,047 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1393 transitions. Word has length 125 [2025-02-06 03:31:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1393 transitions. [2025-02-06 03:31:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1393 transitions. [2025-02-06 03:31:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:53,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:53,049 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:53,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 03:31:53,049 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:53,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1329888841, now seen corresponding path program 1 times [2025-02-06 03:31:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610741641] [2025-02-06 03:31:53,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:53,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:53,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:53,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:53,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610741641] [2025-02-06 03:31:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610741641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:31:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63666019] [2025-02-06 03:31:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:54,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:31:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:54,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:31:54,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:31:54,566 INFO L87 Difference]: Start difference. First operand 1113 states and 1393 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:56,033 INFO L93 Difference]: Finished difference Result 1877 states and 2358 transitions. [2025-02-06 03:31:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:31:56,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:31:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:56,045 INFO L225 Difference]: With dead ends: 1877 [2025-02-06 03:31:56,045 INFO L226 Difference]: Without dead ends: 1362 [2025-02-06 03:31:56,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:31:56,047 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 356 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:56,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 662 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:31:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-02-06 03:31:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1116. [2025-02-06 03:31:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1048 states have (on average 1.2328244274809161) internal successors, (1292), 1049 states have internal predecessors, (1292), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1396 transitions. [2025-02-06 03:31:56,143 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1396 transitions. Word has length 125 [2025-02-06 03:31:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:56,143 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1396 transitions. [2025-02-06 03:31:56,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:31:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1396 transitions. [2025-02-06 03:31:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:56,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:56,144 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 03:31:56,144 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 185901561, now seen corresponding path program 1 times [2025-02-06 03:31:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419303720] [2025-02-06 03:31:56,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:56,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:56,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:56,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:31:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:31:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:31:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419303720] [2025-02-06 03:31:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419303720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:31:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:31:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:31:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325355492] [2025-02-06 03:31:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:31:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:31:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:31:56,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:31:56,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:31:56,801 INFO L87 Difference]: Start difference. First operand 1116 states and 1396 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:31:57,738 INFO L93 Difference]: Finished difference Result 1895 states and 2378 transitions. [2025-02-06 03:31:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:31:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-02-06 03:31:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:31:57,743 INFO L225 Difference]: With dead ends: 1895 [2025-02-06 03:31:57,743 INFO L226 Difference]: Without dead ends: 1330 [2025-02-06 03:31:57,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:31:57,744 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 524 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:31:57,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 554 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:31:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-06 03:31:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1128. [2025-02-06 03:31:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1060 states have (on average 1.230188679245283) internal successors, (1304), 1061 states have internal predecessors, (1304), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:31:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1408 transitions. [2025-02-06 03:31:57,827 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1408 transitions. Word has length 125 [2025-02-06 03:31:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:31:57,827 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1408 transitions. [2025-02-06 03:31:57,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:31:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1408 transitions. [2025-02-06 03:31:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:31:57,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:31:57,828 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:31:57,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 03:31:57,828 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:31:57,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:31:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -987063369, now seen corresponding path program 1 times [2025-02-06 03:31:57,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:31:57,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894930901] [2025-02-06 03:31:57,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:31:57,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:31:57,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:31:57,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:31:57,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:31:57,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:32:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:32:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:32:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894930901] [2025-02-06 03:32:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894930901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:32:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:32:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:32:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424157206] [2025-02-06 03:32:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:32:00,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:32:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:32:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:32:00,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:32:00,345 INFO L87 Difference]: Start difference. First operand 1128 states and 1408 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:32:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:32:03,012 INFO L93 Difference]: Finished difference Result 1924 states and 2420 transitions. [2025-02-06 03:32:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:32:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:32:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:32:03,016 INFO L225 Difference]: With dead ends: 1924 [2025-02-06 03:32:03,016 INFO L226 Difference]: Without dead ends: 1382 [2025-02-06 03:32:03,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:32:03,018 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 157 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:32:03,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 659 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:32:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-02-06 03:32:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1134. [2025-02-06 03:32:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1066 states have (on average 1.2288930581613509) internal successors, (1310), 1067 states have internal predecessors, (1310), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:32:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1414 transitions. [2025-02-06 03:32:03,130 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1414 transitions. Word has length 125 [2025-02-06 03:32:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:32:03,130 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1414 transitions. [2025-02-06 03:32:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:32:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1414 transitions. [2025-02-06 03:32:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:32:03,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:32:03,137 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:32:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 03:32:03,138 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:32:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:32:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1575699590, now seen corresponding path program 1 times [2025-02-06 03:32:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:32:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71909804] [2025-02-06 03:32:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:32:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:32:03,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:32:03,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:32:03,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:32:03,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:32:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:32:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:32:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71909804] [2025-02-06 03:32:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71909804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:32:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:32:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:32:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588781046] [2025-02-06 03:32:04,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:32:04,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:32:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:32:04,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:32:04,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:32:04,622 INFO L87 Difference]: Start difference. First operand 1134 states and 1414 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:32:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:32:06,787 INFO L93 Difference]: Finished difference Result 1935 states and 2415 transitions. [2025-02-06 03:32:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:32:06,787 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:32:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:32:06,791 INFO L225 Difference]: With dead ends: 1935 [2025-02-06 03:32:06,791 INFO L226 Difference]: Without dead ends: 1399 [2025-02-06 03:32:06,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:32:06,792 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 343 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:32:06,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 679 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:32:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-06 03:32:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1128. [2025-02-06 03:32:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1060 states have (on average 1.2188679245283018) internal successors, (1292), 1061 states have internal predecessors, (1292), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:32:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1396 transitions. [2025-02-06 03:32:06,874 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1396 transitions. Word has length 125 [2025-02-06 03:32:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:32:06,874 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1396 transitions. [2025-02-06 03:32:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:32:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1396 transitions. [2025-02-06 03:32:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:32:06,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:32:06,875 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:32:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 03:32:06,875 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:32:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:32:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1285161916, now seen corresponding path program 1 times [2025-02-06 03:32:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:32:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79102195] [2025-02-06 03:32:06,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:32:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:32:06,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:32:06,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:32:06,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:32:06,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:32:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:32:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:32:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79102195] [2025-02-06 03:32:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79102195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:32:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:32:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:32:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660460624] [2025-02-06 03:32:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:32:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:32:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:32:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:32:08,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:32:08,959 INFO L87 Difference]: Start difference. First operand 1128 states and 1396 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14)