./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.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-a_file-27.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 e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:13:43,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:13:43,794 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:13:43,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:13:43,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:13:43,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:13:43,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:13:43,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:13:43,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:13:43,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:13:43,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:13:43,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:13:43,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:13:43,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:13:43,826 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:13:43,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:13:43,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:13:43,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:43,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:13:43,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:13:43,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:13:43,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:13:43,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:13:43,829 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 -> e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 [2025-02-06 03:13:44,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:13:44,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:13:44,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:13:44,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:13:44,076 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:13:44,077 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-a_file-27.i [2025-02-06 03:13:45,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc4cc6da5/89215d6596c64a299e859ee4bb5b0b61/FLAG7e23ea102 [2025-02-06 03:13:45,541 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:13:45,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2025-02-06 03:13:45,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc4cc6da5/89215d6596c64a299e859ee4bb5b0b61/FLAG7e23ea102 [2025-02-06 03:13:45,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc4cc6da5/89215d6596c64a299e859ee4bb5b0b61 [2025-02-06 03:13:45,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:13:45,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:13:45,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:45,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:13:45,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:13:45,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f332e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45, skipping insertion in model container [2025-02-06 03:13:45,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:13:45,691 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-a_file-27.i[916,929] [2025-02-06 03:13:45,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:45,756 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:13:45,764 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-a_file-27.i[916,929] [2025-02-06 03:13:45,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:45,823 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:13:45,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45 WrapperNode [2025-02-06 03:13:45,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:45,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:45,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:13:45,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:13:45,829 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:13:45" (1/1) ... [2025-02-06 03:13:45,837 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:13:45" (1/1) ... [2025-02-06 03:13:45,857 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-02-06 03:13:45,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:45,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:13:45,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:13:45,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:13:45,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,881 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2025-02-06 03:13:45,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:13:45,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:13:45,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:13:45,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:13:45,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (1/1) ... [2025-02-06 03:13:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:45,926 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:13:45,928 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:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:13:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:13:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:13:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:13:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:13:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:13:45,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:13:46,042 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:13:46,044 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:13:46,329 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem67#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite100#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1; [2025-02-06 03:13:46,370 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-02-06 03:13:46,370 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:13:46,383 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:13:46,383 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:13:46,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:46 BoogieIcfgContainer [2025-02-06 03:13:46,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:13:46,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:13:46,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:13:46,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:13:46,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:13:45" (1/3) ... [2025-02-06 03:13:46,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a6b227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:46, skipping insertion in model container [2025-02-06 03:13:46,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:45" (2/3) ... [2025-02-06 03:13:46,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a6b227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:46, skipping insertion in model container [2025-02-06 03:13:46,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:46" (3/3) ... [2025-02-06 03:13:46,393 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-27.i [2025-02-06 03:13:46,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:13:46,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-27.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:13:46,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:13:46,461 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;@3e72e480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:13:46,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:13:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:13:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:13:46,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:46,474 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:46,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 887028870, now seen corresponding path program 1 times [2025-02-06 03:13:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379786318] [2025-02-06 03:13:46,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:13:46,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:13:46,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:46,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:13:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379786318] [2025-02-06 03:13:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379786318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289636609] [2025-02-06 03:13:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:46,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:46,708 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:13:46,709 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:13:46,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:13:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:13:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:46,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:13:46,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:13:46,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289636609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:13:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:13:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448078687] [2025-02-06 03:13:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:13:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:46,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:13:46,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:46,959 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:46,981 INFO L93 Difference]: Finished difference Result 180 states and 280 transitions. [2025-02-06 03:13:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:13:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:13:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:46,987 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:13:46,987 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 03:13:46,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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:13:46,992 INFO L435 NwaCegarLoop]: 129 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, 129 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:13:46,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 03:13:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 03:13:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:13:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-02-06 03:13:47,028 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 131 [2025-02-06 03:13:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:47,029 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-02-06 03:13:47,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-02-06 03:13:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:13:47,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:47,032 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:47,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:13:47,236 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:13:47,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:47,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 564543445, now seen corresponding path program 1 times [2025-02-06 03:13:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610949689] [2025-02-06 03:13:47,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:47,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:13:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:13:47,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:47,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:48,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:48,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610949689] [2025-02-06 03:13:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610949689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486728500] [2025-02-06 03:13:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:48,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:48,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:48,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:48,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:48,043 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:48,172 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-02-06 03:13:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:48,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:13:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:48,176 INFO L225 Difference]: With dead ends: 232 [2025-02-06 03:13:48,176 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:13:48,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:48,177 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 147 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:48,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 446 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:13:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-02-06 03:13:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 121 states have internal predecessors, (166), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:13:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2025-02-06 03:13:48,202 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 131 [2025-02-06 03:13:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:48,203 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2025-02-06 03:13:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2025-02-06 03:13:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:13:48,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:48,205 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:13:48,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash -279928426, now seen corresponding path program 1 times [2025-02-06 03:13:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:48,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463559413] [2025-02-06 03:13:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:48,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:13:48,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:13:48,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:48,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463559413] [2025-02-06 03:13:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463559413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828529352] [2025-02-06 03:13:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:48,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:48,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:48,680 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:48,828 INFO L93 Difference]: Finished difference Result 420 states and 606 transitions. [2025-02-06 03:13:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-02-06 03:13:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:48,834 INFO L225 Difference]: With dead ends: 420 [2025-02-06 03:13:48,836 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:13:48,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:48,838 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 377 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:13:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2025-02-06 03:13:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 234 states have internal predecessors, (320), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 03:13:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 396 transitions. [2025-02-06 03:13:48,880 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 396 transitions. Word has length 131 [2025-02-06 03:13:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 396 transitions. [2025-02-06 03:13:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 396 transitions. [2025-02-06 03:13:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:13:48,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:48,886 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:48,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:13:48,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:48,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1809307926, now seen corresponding path program 1 times [2025-02-06 03:13:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341414233] [2025-02-06 03:13:48,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:48,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:13:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:13:48,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341414233] [2025-02-06 03:13:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341414233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918167170] [2025-02-06 03:13:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:49,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:49,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:49,288 INFO L87 Difference]: Start difference. First operand 275 states and 396 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:49,397 INFO L93 Difference]: Finished difference Result 659 states and 940 transitions. [2025-02-06 03:13:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:13:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:49,401 INFO L225 Difference]: With dead ends: 659 [2025-02-06 03:13:49,404 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 03:13:49,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:49,405 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:49,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 642 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 03:13:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2025-02-06 03:13:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 174 states have internal predecessors, (232), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:13:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. [2025-02-06 03:13:49,437 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 300 transitions. Word has length 131 [2025-02-06 03:13:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:49,438 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 300 transitions. [2025-02-06 03:13:49,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 300 transitions. [2025-02-06 03:13:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:13:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:49,439 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:13:49,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1220380393, now seen corresponding path program 1 times [2025-02-06 03:13:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855885496] [2025-02-06 03:13:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:49,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:13:49,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:13:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855885496] [2025-02-06 03:13:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855885496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:50,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:50,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:13:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289151627] [2025-02-06 03:13:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:50,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:13:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:50,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:13:50,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:50,160 INFO L87 Difference]: Start difference. First operand 213 states and 300 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:50,586 INFO L93 Difference]: Finished difference Result 453 states and 631 transitions. [2025-02-06 03:13:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:13:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-02-06 03:13:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:50,590 INFO L225 Difference]: With dead ends: 453 [2025-02-06 03:13:50,591 INFO L226 Difference]: Without dead ends: 345 [2025-02-06 03:13:50,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:13:50,593 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:50,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 885 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-06 03:13:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 285. [2025-02-06 03:13:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 238 states have (on average 1.3361344537815125) internal successors, (318), 239 states have internal predecessors, (318), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:13:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 398 transitions. [2025-02-06 03:13:50,623 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 398 transitions. Word has length 132 [2025-02-06 03:13:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:50,624 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 398 transitions. [2025-02-06 03:13:50,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 398 transitions. [2025-02-06 03:13:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:13:50,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:50,625 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:13:50,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash 287171416, now seen corresponding path program 1 times [2025-02-06 03:13:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327040720] [2025-02-06 03:13:50,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:50,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:13:50,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:13:50,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:50,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327040720] [2025-02-06 03:13:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327040720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595615442] [2025-02-06 03:13:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:51,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:51,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:51,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:51,328 INFO L87 Difference]: Start difference. First operand 285 states and 398 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:51,547 INFO L93 Difference]: Finished difference Result 584 states and 811 transitions. [2025-02-06 03:13:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:13:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:51,552 INFO L225 Difference]: With dead ends: 584 [2025-02-06 03:13:51,552 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 03:13:51,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:13:51,553 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 69 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:51,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 680 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 03:13:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2025-02-06 03:13:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 251 states have (on average 1.3386454183266931) internal successors, (336), 252 states have internal predecessors, (336), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:13:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 416 transitions. [2025-02-06 03:13:51,574 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 416 transitions. Word has length 132 [2025-02-06 03:13:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:51,574 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 416 transitions. [2025-02-06 03:13:51,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 416 transitions. [2025-02-06 03:13:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:13:51,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:51,575 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:13:51,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1764444269, now seen corresponding path program 1 times [2025-02-06 03:13:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914218434] [2025-02-06 03:13:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:51,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:13:51,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:13:51,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:51,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914218434] [2025-02-06 03:13:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914218434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609595694] [2025-02-06 03:13:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:51,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:51,822 INFO L87 Difference]: Start difference. First operand 298 states and 416 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:51,934 INFO L93 Difference]: Finished difference Result 601 states and 838 transitions. [2025-02-06 03:13:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-02-06 03:13:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:51,938 INFO L225 Difference]: With dead ends: 601 [2025-02-06 03:13:51,938 INFO L226 Difference]: Without dead ends: 306 [2025-02-06 03:13:51,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:51,939 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 72 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:51,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 373 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-06 03:13:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2025-02-06 03:13:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 251 states have (on average 1.3346613545816732) internal successors, (335), 252 states have internal predecessors, (335), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:13:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 415 transitions. [2025-02-06 03:13:51,963 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 415 transitions. Word has length 133 [2025-02-06 03:13:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:51,965 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 415 transitions. [2025-02-06 03:13:51,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 415 transitions. [2025-02-06 03:13:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:13:51,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:51,966 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:13:51,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:51,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash 699314900, now seen corresponding path program 1 times [2025-02-06 03:13:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42611029] [2025-02-06 03:13:51,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:13:51,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:13:51,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:52,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42611029] [2025-02-06 03:13:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42611029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:52,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282511686] [2025-02-06 03:13:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:52,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:52,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:52,133 INFO L87 Difference]: Start difference. First operand 298 states and 415 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:52,322 INFO L93 Difference]: Finished difference Result 601 states and 836 transitions. [2025-02-06 03:13:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:13:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:52,325 INFO L225 Difference]: With dead ends: 601 [2025-02-06 03:13:52,325 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 03:13:52,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:52,326 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 113 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:52,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 463 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 03:13:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 389. [2025-02-06 03:13:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 322 states have (on average 1.3229813664596273) internal successors, (426), 323 states have internal predecessors, (426), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:13:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 540 transitions. [2025-02-06 03:13:52,357 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 540 transitions. Word has length 134 [2025-02-06 03:13:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:52,357 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 540 transitions. [2025-02-06 03:13:52,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 540 transitions. [2025-02-06 03:13:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:13:52,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:52,359 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:13:52,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1025690742, now seen corresponding path program 1 times [2025-02-06 03:13:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512395578] [2025-02-06 03:13:52,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:13:52,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:13:52,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:52,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512395578] [2025-02-06 03:13:52,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512395578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:52,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844139987] [2025-02-06 03:13:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:52,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:52,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:52,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:52,525 INFO L87 Difference]: Start difference. First operand 389 states and 540 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:52,724 INFO L93 Difference]: Finished difference Result 707 states and 979 transitions. [2025-02-06 03:13:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:13:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:52,727 INFO L225 Difference]: With dead ends: 707 [2025-02-06 03:13:52,727 INFO L226 Difference]: Without dead ends: 397 [2025-02-06 03:13:52,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:52,728 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 109 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:52,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 538 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-06 03:13:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 287. [2025-02-06 03:13:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 240 states have internal predecessors, (312), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:13:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 392 transitions. [2025-02-06 03:13:52,766 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 392 transitions. Word has length 134 [2025-02-06 03:13:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:52,766 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 392 transitions. [2025-02-06 03:13:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 392 transitions. [2025-02-06 03:13:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:52,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:52,768 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:13:52,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2142970297, now seen corresponding path program 1 times [2025-02-06 03:13:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:52,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169442862] [2025-02-06 03:13:52,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:52,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:53,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169442862] [2025-02-06 03:13:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169442862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:13:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246504817] [2025-02-06 03:13:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:13:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:53,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:13:53,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:53,580 INFO L87 Difference]: Start difference. First operand 287 states and 392 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:13:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:53,965 INFO L93 Difference]: Finished difference Result 812 states and 1102 transitions. [2025-02-06 03:13:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:13:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-02-06 03:13:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:53,968 INFO L225 Difference]: With dead ends: 812 [2025-02-06 03:13:53,968 INFO L226 Difference]: Without dead ends: 528 [2025-02-06 03:13:53,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:13:53,970 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 74 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:53,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 785 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-06 03:13:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 524. [2025-02-06 03:13:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 447 states have (on average 1.2975391498881432) internal successors, (580), 451 states have internal predecessors, (580), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:13:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 704 transitions. [2025-02-06 03:13:54,001 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 704 transitions. Word has length 135 [2025-02-06 03:13:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 704 transitions. [2025-02-06 03:13:54,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:13:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 704 transitions. [2025-02-06 03:13:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:54,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:54,003 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:13:54,003 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:54,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash 813006321, now seen corresponding path program 1 times [2025-02-06 03:13:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457710511] [2025-02-06 03:13:54,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:54,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:54,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:54,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:54,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:54,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457710511] [2025-02-06 03:13:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457710511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:13:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729983187] [2025-02-06 03:13:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:54,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:13:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:54,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:13:54,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:54,568 INFO L87 Difference]: Start difference. First operand 524 states and 704 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:13:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:54,846 INFO L93 Difference]: Finished difference Result 1285 states and 1720 transitions. [2025-02-06 03:13:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:13:54,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-02-06 03:13:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:54,850 INFO L225 Difference]: With dead ends: 1285 [2025-02-06 03:13:54,850 INFO L226 Difference]: Without dead ends: 764 [2025-02-06 03:13:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:13:54,852 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 62 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:54,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 825 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-02-06 03:13:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 758. [2025-02-06 03:13:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 657 states have (on average 1.299847792998478) internal successors, (854), 665 states have internal predecessors, (854), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:13:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1010 transitions. [2025-02-06 03:13:54,895 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1010 transitions. Word has length 135 [2025-02-06 03:13:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:54,895 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1010 transitions. [2025-02-06 03:13:54,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:13:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1010 transitions. [2025-02-06 03:13:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:54,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:54,897 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:13:54,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 942089040, now seen corresponding path program 1 times [2025-02-06 03:13:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310515521] [2025-02-06 03:13:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:54,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:54,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:54,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:54,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:55,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:55,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310515521] [2025-02-06 03:13:55,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310515521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:55,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:55,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:13:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199572867] [2025-02-06 03:13:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:55,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:13:55,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:55,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:13:55,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:13:55,425 INFO L87 Difference]: Start difference. First operand 758 states and 1010 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:55,821 INFO L93 Difference]: Finished difference Result 1532 states and 2035 transitions. [2025-02-06 03:13:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:13:55,822 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:13:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:55,827 INFO L225 Difference]: With dead ends: 1532 [2025-02-06 03:13:55,827 INFO L226 Difference]: Without dead ends: 777 [2025-02-06 03:13:55,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:13:55,830 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 61 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:55,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1357 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-06 03:13:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 754. [2025-02-06 03:13:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 653 states have (on average 1.2924961715160797) internal successors, (844), 661 states have internal predecessors, (844), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:13:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1000 transitions. [2025-02-06 03:13:55,879 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1000 transitions. Word has length 135 [2025-02-06 03:13:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:55,879 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1000 transitions. [2025-02-06 03:13:55,880 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1000 transitions. [2025-02-06 03:13:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:55,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:55,881 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:55,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:13:55,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:55,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1221830546, now seen corresponding path program 1 times [2025-02-06 03:13:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:55,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205257153] [2025-02-06 03:13:55,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:55,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:55,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:55,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:55,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:55,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205257153] [2025-02-06 03:13:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205257153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:13:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852754306] [2025-02-06 03:13:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:56,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:13:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:56,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:13:56,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:13:56,494 INFO L87 Difference]: Start difference. First operand 754 states and 1000 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:56,890 INFO L93 Difference]: Finished difference Result 1553 states and 2052 transitions. [2025-02-06 03:13:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:13:56,890 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:13:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:56,894 INFO L225 Difference]: With dead ends: 1553 [2025-02-06 03:13:56,894 INFO L226 Difference]: Without dead ends: 802 [2025-02-06 03:13:56,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:13:56,897 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 71 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:56,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1186 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-06 03:13:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 667. [2025-02-06 03:13:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 570 states have (on average 1.275438596491228) internal successors, (727), 576 states have internal predecessors, (727), 74 states have call successors, (74), 22 states have call predecessors, (74), 22 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:13:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 875 transitions. [2025-02-06 03:13:56,939 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 875 transitions. Word has length 135 [2025-02-06 03:13:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:56,940 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 875 transitions. [2025-02-06 03:13:56,940 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 875 transitions. [2025-02-06 03:13:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:56,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:56,942 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:13:56,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1350913265, now seen corresponding path program 1 times [2025-02-06 03:13:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424932297] [2025-02-06 03:13:56,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:56,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:56,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:56,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424932297] [2025-02-06 03:13:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424932297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:13:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799759024] [2025-02-06 03:13:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:57,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:13:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:57,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:13:57,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:13:57,455 INFO L87 Difference]: Start difference. First operand 667 states and 875 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:57,760 INFO L93 Difference]: Finished difference Result 1333 states and 1743 transitions. [2025-02-06 03:13:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:13:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:13:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:57,765 INFO L225 Difference]: With dead ends: 1333 [2025-02-06 03:13:57,765 INFO L226 Difference]: Without dead ends: 669 [2025-02-06 03:13:57,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:57,767 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:57,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 937 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-02-06 03:13:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 564. [2025-02-06 03:13:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 487 states have internal predecessors, (614), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:13:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 738 transitions. [2025-02-06 03:13:57,811 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 738 transitions. Word has length 135 [2025-02-06 03:13:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:57,812 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 738 transitions. [2025-02-06 03:13:57,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 738 transitions. [2025-02-06 03:13:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:57,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:57,813 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:13:57,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:57,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2111950490, now seen corresponding path program 1 times [2025-02-06 03:13:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538017512] [2025-02-06 03:13:57,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:57,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:57,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:57,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538017512] [2025-02-06 03:13:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538017512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45191330] [2025-02-06 03:13:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:57,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:57,960 INFO L87 Difference]: Start difference. First operand 564 states and 738 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:58,039 INFO L93 Difference]: Finished difference Result 1132 states and 1482 transitions. [2025-02-06 03:13:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:58,040 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:13:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:58,042 INFO L225 Difference]: With dead ends: 1132 [2025-02-06 03:13:58,042 INFO L226 Difference]: Without dead ends: 571 [2025-02-06 03:13:58,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:13:58,045 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 51 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:58,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 541 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-06 03:13:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2025-02-06 03:13:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 486 states have (on average 1.2695473251028806) internal successors, (617), 490 states have internal predecessors, (617), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:13:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 741 transitions. [2025-02-06 03:13:58,075 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 741 transitions. Word has length 135 [2025-02-06 03:13:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 741 transitions. [2025-02-06 03:13:58,076 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:13:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 741 transitions. [2025-02-06 03:13:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:13:58,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:58,077 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:13:58,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:58,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 386065447, now seen corresponding path program 1 times [2025-02-06 03:13:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002151465] [2025-02-06 03:13:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:58,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:13:58,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:13:58,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:58,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002151465] [2025-02-06 03:13:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002151465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593814836] [2025-02-06 03:13:58,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:58,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:58,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:58,255 INFO L87 Difference]: Start difference. First operand 567 states and 741 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:58,349 INFO L93 Difference]: Finished difference Result 1240 states and 1618 transitions. [2025-02-06 03:13:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:13:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:58,352 INFO L225 Difference]: With dead ends: 1240 [2025-02-06 03:13:58,352 INFO L226 Difference]: Without dead ends: 676 [2025-02-06 03:13:58,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:58,353 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:58,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 566 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-06 03:13:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 581. [2025-02-06 03:13:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 500 states have (on average 1.252) internal successors, (626), 504 states have internal predecessors, (626), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:13:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 750 transitions. [2025-02-06 03:13:58,398 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 750 transitions. Word has length 135 [2025-02-06 03:13:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 750 transitions. [2025-02-06 03:13:58,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:13:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 750 transitions. [2025-02-06 03:13:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:13:58,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:58,400 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:13:58,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -129115165, now seen corresponding path program 1 times [2025-02-06 03:13:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033579743] [2025-02-06 03:13:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:13:58,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:13:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:13:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033579743] [2025-02-06 03:13:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033579743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64906573] [2025-02-06 03:13:58,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:58,610 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:13:58,611 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:13:58,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:13:58,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:13:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:58,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:13:58,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:58,818 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:13:58,836 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:13:58,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 03:13:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 268 proven. 30 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-02-06 03:13:58,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:13:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64906573] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:13:59,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:13:59,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 03:13:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257858267] [2025-02-06 03:13:59,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:59,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:13:59,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:59,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:13:59,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:13:59,075 INFO L87 Difference]: Start difference. First operand 581 states and 750 transitions. Second operand has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-02-06 03:13:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:59,390 INFO L93 Difference]: Finished difference Result 1147 states and 1464 transitions. [2025-02-06 03:13:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:13:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) Word has length 139 [2025-02-06 03:13:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:59,393 INFO L225 Difference]: With dead ends: 1147 [2025-02-06 03:13:59,393 INFO L226 Difference]: Without dead ends: 569 [2025-02-06 03:13:59,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:13:59,395 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:59,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 424 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-06 03:13:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 541. [2025-02-06 03:13:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 456 states have (on average 1.230263157894737) internal successors, (561), 460 states have internal predecessors, (561), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:13:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 685 transitions. [2025-02-06 03:13:59,427 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 685 transitions. Word has length 139 [2025-02-06 03:13:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:59,428 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 685 transitions. [2025-02-06 03:13:59,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-02-06 03:13:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 685 transitions. [2025-02-06 03:13:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:13:59,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:59,430 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:13:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 03:13:59,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1424412155, now seen corresponding path program 1 times [2025-02-06 03:13:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450485324] [2025-02-06 03:13:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:13:59,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:13:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:13:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450485324] [2025-02-06 03:13:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450485324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496225952] [2025-02-06 03:13:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:59,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:59,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:59,916 INFO L87 Difference]: Start difference. First operand 541 states and 685 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:00,087 INFO L93 Difference]: Finished difference Result 1481 states and 1874 transitions. [2025-02-06 03:14:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:14:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:00,091 INFO L225 Difference]: With dead ends: 1481 [2025-02-06 03:14:00,091 INFO L226 Difference]: Without dead ends: 943 [2025-02-06 03:14:00,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:00,093 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:00,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 441 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-06 03:14:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 681. [2025-02-06 03:14:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 596 states have (on average 1.2432885906040267) internal successors, (741), 600 states have internal predecessors, (741), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 865 transitions. [2025-02-06 03:14:00,129 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 865 transitions. Word has length 139 [2025-02-06 03:14:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 865 transitions. [2025-02-06 03:14:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 865 transitions. [2025-02-06 03:14:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:00,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:00,132 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:14:00,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1063100678, now seen corresponding path program 1 times [2025-02-06 03:14:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022814254] [2025-02-06 03:14:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:00,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:00,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:00,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:00,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022814254] [2025-02-06 03:14:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022814254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:14:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067031137] [2025-02-06 03:14:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:14:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:00,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:14:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:00,654 INFO L87 Difference]: Start difference. First operand 681 states and 865 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:01,034 INFO L93 Difference]: Finished difference Result 1529 states and 1938 transitions. [2025-02-06 03:14:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:14:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-02-06 03:14:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:01,038 INFO L225 Difference]: With dead ends: 1529 [2025-02-06 03:14:01,038 INFO L226 Difference]: Without dead ends: 851 [2025-02-06 03:14:01,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:14:01,039 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 63 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:01,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1224 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:14:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-02-06 03:14:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 697. [2025-02-06 03:14:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 612 states have (on average 1.2369281045751634) internal successors, (757), 616 states have internal predecessors, (757), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 881 transitions. [2025-02-06 03:14:01,071 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 881 transitions. Word has length 139 [2025-02-06 03:14:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:01,071 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 881 transitions. [2025-02-06 03:14:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 881 transitions. [2025-02-06 03:14:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:01,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:01,074 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:14:01,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1825924609, now seen corresponding path program 1 times [2025-02-06 03:14:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492580798] [2025-02-06 03:14:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:01,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:01,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:01,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:01,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492580798] [2025-02-06 03:14:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492580798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:01,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:01,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495429490] [2025-02-06 03:14:01,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:01,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:01,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:01,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:01,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:01,252 INFO L87 Difference]: Start difference. First operand 697 states and 881 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:01,346 INFO L93 Difference]: Finished difference Result 1506 states and 1907 transitions. [2025-02-06 03:14:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:01,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-02-06 03:14:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:01,350 INFO L225 Difference]: With dead ends: 1506 [2025-02-06 03:14:01,350 INFO L226 Difference]: Without dead ends: 812 [2025-02-06 03:14:01,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:01,352 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:01,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 563 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-02-06 03:14:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 725. [2025-02-06 03:14:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 640 states have (on average 1.2375) internal successors, (792), 644 states have internal predecessors, (792), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 916 transitions. [2025-02-06 03:14:01,382 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 916 transitions. Word has length 139 [2025-02-06 03:14:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:01,383 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 916 transitions. [2025-02-06 03:14:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2025-02-06 03:14:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:01,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:01,384 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:01,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:14:01,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 18470146, now seen corresponding path program 1 times [2025-02-06 03:14:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909626132] [2025-02-06 03:14:01,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:01,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:01,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:14:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909626132] [2025-02-06 03:14:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909626132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361773880] [2025-02-06 03:14:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:01,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:01,479 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:14:01,480 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:14:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:01,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:01,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:01,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:14:01,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:01,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361773880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:01,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:14:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863225432] [2025-02-06 03:14:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:01,643 INFO L87 Difference]: Start difference. First operand 725 states and 916 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:01,708 INFO L93 Difference]: Finished difference Result 1468 states and 1856 transitions. [2025-02-06 03:14:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:14:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:01,712 INFO L225 Difference]: With dead ends: 1468 [2025-02-06 03:14:01,712 INFO L226 Difference]: Without dead ends: 746 [2025-02-06 03:14:01,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:01,714 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:01,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-06 03:14:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2025-02-06 03:14:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 649 states have (on average 1.234206471494607) internal successors, (801), 653 states have internal predecessors, (801), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 925 transitions. [2025-02-06 03:14:01,745 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 925 transitions. Word has length 139 [2025-02-06 03:14:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:01,745 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 925 transitions. [2025-02-06 03:14:01,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 925 transitions. [2025-02-06 03:14:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:01,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:01,747 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:01,753 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:14:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:01,948 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1476039638, now seen corresponding path program 1 times [2025-02-06 03:14:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182500214] [2025-02-06 03:14:01,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:01,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:01,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:01,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:01,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182500214] [2025-02-06 03:14:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182500214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884655587] [2025-02-06 03:14:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:02,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:02,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:02,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:02,220 INFO L87 Difference]: Start difference. First operand 734 states and 925 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:02,318 INFO L93 Difference]: Finished difference Result 1595 states and 2003 transitions. [2025-02-06 03:14:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-02-06 03:14:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:02,321 INFO L225 Difference]: With dead ends: 1595 [2025-02-06 03:14:02,321 INFO L226 Difference]: Without dead ends: 780 [2025-02-06 03:14:02,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:02,326 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 109 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:02,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 579 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-02-06 03:14:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 690. [2025-02-06 03:14:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 605 states have (on average 1.2132231404958678) internal successors, (734), 609 states have internal predecessors, (734), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 858 transitions. [2025-02-06 03:14:02,359 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 858 transitions. Word has length 139 [2025-02-06 03:14:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 858 transitions. [2025-02-06 03:14:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 858 transitions. [2025-02-06 03:14:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:02,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:02,361 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:14:02,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:02,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 31512171, now seen corresponding path program 1 times [2025-02-06 03:14:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:02,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843127948] [2025-02-06 03:14:02,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:02,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:02,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:02,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:02,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:02,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843127948] [2025-02-06 03:14:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843127948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:14:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338057461] [2025-02-06 03:14:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:14:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:03,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:14:03,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:03,074 INFO L87 Difference]: Start difference. First operand 690 states and 858 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:03,812 INFO L93 Difference]: Finished difference Result 1703 states and 2102 transitions. [2025-02-06 03:14:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:14:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-02-06 03:14:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:03,817 INFO L225 Difference]: With dead ends: 1703 [2025-02-06 03:14:03,818 INFO L226 Difference]: Without dead ends: 1016 [2025-02-06 03:14:03,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:14:03,820 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 343 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:03,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 578 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:14:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-06 03:14:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 772. [2025-02-06 03:14:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 675 states have (on average 1.208888888888889) internal successors, (816), 681 states have internal predecessors, (816), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:14:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 956 transitions. [2025-02-06 03:14:03,870 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 956 transitions. Word has length 139 [2025-02-06 03:14:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 956 transitions. [2025-02-06 03:14:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 956 transitions. [2025-02-06 03:14:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:14:03,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:03,872 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:14:03,872 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:03,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1013118361, now seen corresponding path program 1 times [2025-02-06 03:14:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749540221] [2025-02-06 03:14:03,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:14:03,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:14:03,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749540221] [2025-02-06 03:14:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749540221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007293089] [2025-02-06 03:14:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:04,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:04,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:04,067 INFO L87 Difference]: Start difference. First operand 772 states and 956 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:04,260 INFO L93 Difference]: Finished difference Result 1710 states and 2112 transitions. [2025-02-06 03:14:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:14:04,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:14:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:04,266 INFO L225 Difference]: With dead ends: 1710 [2025-02-06 03:14:04,267 INFO L226 Difference]: Without dead ends: 941 [2025-02-06 03:14:04,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:14:04,268 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 53 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:04,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 837 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-06 03:14:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 812. [2025-02-06 03:14:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 715 states have (on average 1.2111888111888112) internal successors, (866), 721 states have internal predecessors, (866), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:14:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1006 transitions. [2025-02-06 03:14:04,314 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1006 transitions. Word has length 139 [2025-02-06 03:14:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:04,315 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1006 transitions. [2025-02-06 03:14:04,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1006 transitions. [2025-02-06 03:14:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:14:04,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:04,317 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:14:04,318 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash -676503386, now seen corresponding path program 1 times [2025-02-06 03:14:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533906525] [2025-02-06 03:14:04,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:04,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:14:04,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:14:04,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:04,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:04,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533906525] [2025-02-06 03:14:04,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533906525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:04,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:04,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:14:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042271622] [2025-02-06 03:14:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:04,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:04,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:04,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:14:04,741 INFO L87 Difference]: Start difference. First operand 812 states and 1006 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:04,956 INFO L93 Difference]: Finished difference Result 1684 states and 2079 transitions. [2025-02-06 03:14:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:04,956 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:14:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:04,960 INFO L225 Difference]: With dead ends: 1684 [2025-02-06 03:14:04,960 INFO L226 Difference]: Without dead ends: 875 [2025-02-06 03:14:04,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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:14:04,962 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:04,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 421 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-06 03:14:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 745. [2025-02-06 03:14:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 658 states have (on average 1.2051671732522797) internal successors, (793), 662 states have internal predecessors, (793), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:14:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 917 transitions. [2025-02-06 03:14:05,004 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 917 transitions. Word has length 140 [2025-02-06 03:14:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:05,004 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 917 transitions. [2025-02-06 03:14:05,004 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 917 transitions. [2025-02-06 03:14:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:14:05,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:05,006 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:14:05,006 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1217089090, now seen corresponding path program 1 times [2025-02-06 03:14:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144859267] [2025-02-06 03:14:05,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:05,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:14:05,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:14:05,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144859267] [2025-02-06 03:14:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144859267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:14:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3617531] [2025-02-06 03:14:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:14:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:14:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:05,301 INFO L87 Difference]: Start difference. First operand 745 states and 917 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:05,507 INFO L93 Difference]: Finished difference Result 1221 states and 1472 transitions. [2025-02-06 03:14:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:14:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:14:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:05,512 INFO L225 Difference]: With dead ends: 1221 [2025-02-06 03:14:05,512 INFO L226 Difference]: Without dead ends: 1219 [2025-02-06 03:14:05,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:05,513 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:05,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1025 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-02-06 03:14:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1215. [2025-02-06 03:14:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1052 states have (on average 1.173003802281369) internal successors, (1234), 1062 states have internal predecessors, (1234), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-06 03:14:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1462 transitions. [2025-02-06 03:14:05,587 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1462 transitions. Word has length 141 [2025-02-06 03:14:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:05,587 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1462 transitions. [2025-02-06 03:14:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1462 transitions. [2025-02-06 03:14:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:14:05,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:05,590 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:14:05,591 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:05,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 696207071, now seen corresponding path program 1 times [2025-02-06 03:14:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461678790] [2025-02-06 03:14:05,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:05,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:14:05,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:14:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:05,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:05,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461678790] [2025-02-06 03:14:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461678790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:05,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687609570] [2025-02-06 03:14:05,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:05,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:05,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:05,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:05,781 INFO L87 Difference]: Start difference. First operand 1215 states and 1462 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:05,914 INFO L93 Difference]: Finished difference Result 2525 states and 3039 transitions. [2025-02-06 03:14:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:14:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:05,919 INFO L225 Difference]: With dead ends: 2525 [2025-02-06 03:14:05,920 INFO L226 Difference]: Without dead ends: 1313 [2025-02-06 03:14:05,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:05,922 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:05,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 591 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-02-06 03:14:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1257. [2025-02-06 03:14:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1094 states have (on average 1.1718464351005484) internal successors, (1282), 1104 states have internal predecessors, (1282), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-06 03:14:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1510 transitions. [2025-02-06 03:14:06,008 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1510 transitions. Word has length 141 [2025-02-06 03:14:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:06,008 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1510 transitions. [2025-02-06 03:14:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1510 transitions. [2025-02-06 03:14:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:14:06,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:06,010 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:14:06,010 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1047459075, now seen corresponding path program 1 times [2025-02-06 03:14:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597368562] [2025-02-06 03:14:06,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:06,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:14:06,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:14:06,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:06,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597368562] [2025-02-06 03:14:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597368562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684505282] [2025-02-06 03:14:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:06,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:06,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:06,185 INFO L87 Difference]: Start difference. First operand 1257 states and 1510 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:06,298 INFO L93 Difference]: Finished difference Result 2231 states and 2678 transitions. [2025-02-06 03:14:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-02-06 03:14:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:06,302 INFO L225 Difference]: With dead ends: 2231 [2025-02-06 03:14:06,302 INFO L226 Difference]: Without dead ends: 977 [2025-02-06 03:14:06,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:06,304 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:06,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 555 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-06 03:14:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-02-06 03:14:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 832 states have (on average 1.1514423076923077) internal successors, (958), 840 states have internal predecessors, (958), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:14:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1158 transitions. [2025-02-06 03:14:06,366 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1158 transitions. Word has length 142 [2025-02-06 03:14:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:06,366 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1158 transitions. [2025-02-06 03:14:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1158 transitions. [2025-02-06 03:14:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:14:06,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:06,368 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:14:06,368 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1856817941, now seen corresponding path program 1 times [2025-02-06 03:14:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54309901] [2025-02-06 03:14:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:06,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:14:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:14:06,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:06,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54309901] [2025-02-06 03:14:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54309901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333821480] [2025-02-06 03:14:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:06,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:06,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:06,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:06,853 INFO L87 Difference]: Start difference. First operand 975 states and 1158 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:07,134 INFO L93 Difference]: Finished difference Result 2076 states and 2456 transitions. [2025-02-06 03:14:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-02-06 03:14:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:07,143 INFO L225 Difference]: With dead ends: 2076 [2025-02-06 03:14:07,143 INFO L226 Difference]: Without dead ends: 1137 [2025-02-06 03:14:07,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:07,149 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:07,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 417 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-02-06 03:14:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 939. [2025-02-06 03:14:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 796 states have (on average 1.1256281407035176) internal successors, (896), 804 states have internal predecessors, (896), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:14:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1096 transitions. [2025-02-06 03:14:07,220 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1096 transitions. Word has length 142 [2025-02-06 03:14:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:07,221 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1096 transitions. [2025-02-06 03:14:07,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:14:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1096 transitions. [2025-02-06 03:14:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:14:07,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,223 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:14:07,223 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:07,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1260513912, now seen corresponding path program 1 times [2025-02-06 03:14:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031239243] [2025-02-06 03:14:07,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:07,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:14:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:14:07,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:07,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031239243] [2025-02-06 03:14:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031239243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816025709] [2025-02-06 03:14:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:07,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:07,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:07,406 INFO L87 Difference]: Start difference. First operand 939 states and 1096 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:07,531 INFO L93 Difference]: Finished difference Result 1773 states and 2069 transitions. [2025-02-06 03:14:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-02-06 03:14:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:07,536 INFO L225 Difference]: With dead ends: 1773 [2025-02-06 03:14:07,536 INFO L226 Difference]: Without dead ends: 870 [2025-02-06 03:14:07,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:07,538 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 122 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:07,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 575 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-02-06 03:14:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 864. [2025-02-06 03:14:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 721 states have (on average 1.116504854368932) internal successors, (805), 729 states have internal predecessors, (805), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:14:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1005 transitions. [2025-02-06 03:14:07,600 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1005 transitions. Word has length 143 [2025-02-06 03:14:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:07,601 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1005 transitions. [2025-02-06 03:14:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1005 transitions. [2025-02-06 03:14:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:14:07,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,604 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:14:07,604 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1481983929, now seen corresponding path program 1 times [2025-02-06 03:14:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:07,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212108770] [2025-02-06 03:14:07,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:07,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:14:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:14:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212108770] [2025-02-06 03:14:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212108770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73941590] [2025-02-06 03:14:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:07,802 INFO L87 Difference]: Start difference. First operand 864 states and 1005 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:07,914 INFO L93 Difference]: Finished difference Result 1650 states and 1910 transitions. [2025-02-06 03:14:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-02-06 03:14:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:07,923 INFO L225 Difference]: With dead ends: 1650 [2025-02-06 03:14:07,923 INFO L226 Difference]: Without dead ends: 822 [2025-02-06 03:14:07,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:07,925 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:07,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 543 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-06 03:14:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2025-02-06 03:14:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 679 states have (on average 1.0883652430044182) internal successors, (739), 687 states have internal predecessors, (739), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:14:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 939 transitions. [2025-02-06 03:14:07,984 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 939 transitions. Word has length 144 [2025-02-06 03:14:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:07,985 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 939 transitions. [2025-02-06 03:14:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:14:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 939 transitions. [2025-02-06 03:14:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:14:07,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,986 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:14:07,986 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -987036794, now seen corresponding path program 1 times [2025-02-06 03:14:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318845388] [2025-02-06 03:14:07,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:07,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:14:08,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:14:08,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:14:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318845388] [2025-02-06 03:14:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318845388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:08,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:08,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:14:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134042318] [2025-02-06 03:14:08,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:08,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:14:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:08,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:14:08,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:08,601 INFO L87 Difference]: Start difference. First operand 822 states and 939 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:14:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:08,931 INFO L93 Difference]: Finished difference Result 1067 states and 1213 transitions. [2025-02-06 03:14:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:14:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-02-06 03:14:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:08,936 INFO L225 Difference]: With dead ends: 1067 [2025-02-06 03:14:08,936 INFO L226 Difference]: Without dead ends: 1065 [2025-02-06 03:14:08,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:14:08,939 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 64 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:08,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1404 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-02-06 03:14:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1061. [2025-02-06 03:14:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 874 states have (on average 1.0823798627002288) internal successors, (946), 885 states have internal predecessors, (946), 130 states have call successors, (130), 56 states have call predecessors, (130), 56 states have return successors, (130), 119 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-06 03:14:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1206 transitions. [2025-02-06 03:14:09,033 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1206 transitions. Word has length 144 [2025-02-06 03:14:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:09,034 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1206 transitions. [2025-02-06 03:14:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:14:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1206 transitions. [2025-02-06 03:14:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:14:09,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:09,036 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:09,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:14:09,037 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:09,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -99533113, now seen corresponding path program 1 times [2025-02-06 03:14:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711341285] [2025-02-06 03:14:09,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:14:09,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:14:09,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:09,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat