./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:21:39,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:39,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:21:39,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:39,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:39,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:39,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:39,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:39,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:39,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:39,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:39,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:21:39,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:39,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:39,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:39,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:39,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:39,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 [2025-03-17 05:21:40,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:40,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:40,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:40,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:40,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:40,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2025-03-17 05:21:41,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b42b0c/fcf3180f216042f88fc14525e5bb4de8/FLAG67541cc70 [2025-03-17 05:21:41,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:21:41,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2025-03-17 05:21:41,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b42b0c/fcf3180f216042f88fc14525e5bb4de8/FLAG67541cc70 [2025-03-17 05:21:41,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b42b0c/fcf3180f216042f88fc14525e5bb4de8 [2025-03-17 05:21:41,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:21:41,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:21:41,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:41,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:21:41,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:21:41,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53338b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41, skipping insertion in model container [2025-03-17 05:21:41,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:21:41,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i[916,929] [2025-03-17 05:21:41,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:41,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:21:41,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i[916,929] [2025-03-17 05:21:41,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:41,831 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:21:41,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41 WrapperNode [2025-03-17 05:21:41,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:41,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:41,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:21:41,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:21:41,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,875 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-17 05:21:41,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:41,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:21:41,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:21:41,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:21:41,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,906 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-03-17 05:21:41,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:21:41,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:21:41,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:21:41,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:21:41,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (1/1) ... [2025-03-17 05:21:41,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:41,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:41,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:21:41,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:21:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:21:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:21:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:21:42,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:21:42,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:42,359 INFO L1322 $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-03-17 05:21:42,384 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:42,385 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:42,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:42,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:42,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:42 BoogieIcfgContainer [2025-03-17 05:21:42,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:42,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:42,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:42,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:42,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:21:41" (1/3) ... [2025-03-17 05:21:42,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e681aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:42, skipping insertion in model container [2025-03-17 05:21:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:41" (2/3) ... [2025-03-17 05:21:42,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e681aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:42, skipping insertion in model container [2025-03-17 05:21:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:42" (3/3) ... [2025-03-17 05:21:42,400 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-27.i [2025-03-17 05:21:42,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:42,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-27.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:42,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:42,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;@1581c403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:42,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 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-03-17 05:21:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:21:42,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:42,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] [2025-03-17 05:21:42,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1538753743, now seen corresponding path program 1 times [2025-03-17 05:21:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885794549] [2025-03-17 05:21:42,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:21:42,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:21:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:21:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885794549] [2025-03-17 05:21:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885794549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:42,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905017450] [2025-03-17 05:21:42,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:42,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:42,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:21:42,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:21:42,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:21:42,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:42,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:42,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:42,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:21:42,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905017450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:21:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836932857] [2025-03-17 05:21:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:42,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:42,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:42,957 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 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) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03-17 05:21:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:42,973 INFO L93 Difference]: Finished difference Result 173 states and 273 transitions. [2025-03-17 05:21:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:42,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 127 [2025-03-17 05:21:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:42,979 INFO L225 Difference]: With dead ends: 173 [2025-03-17 05:21:42,979 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 05:21:42,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:42,983 INFO L435 NwaCegarLoop]: 125 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, 125 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-03-17 05:21:42,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 05:21:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 05:21:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-03-17 05:21:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2025-03-17 05:21:43,017 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 127 [2025-03-17 05:21:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:43,017 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2025-03-17 05:21:43,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03-17 05:21:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2025-03-17 05:21:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:21:43,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:43,021 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] [2025-03-17 05:21:43,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:21:43,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:21:43,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2073879648, now seen corresponding path program 1 times [2025-03-17 05:21:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:43,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634875769] [2025-03-17 05:21:43,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:43,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:21:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:21:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634875769] [2025-03-17 05:21:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634875769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:43,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017862805] [2025-03-17 05:21:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:43,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:43,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:43,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:43,934 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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-03-17 05:21:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:44,040 INFO L93 Difference]: Finished difference Result 225 states and 326 transitions. [2025-03-17 05:21:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:44,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 127 [2025-03-17 05:21:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:44,044 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:21:44,046 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 05:21:44,046 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-03-17 05:21:44,047 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 141 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 432 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-03-17 05:21:44,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 432 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 05:21:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-03-17 05:21:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 116 states have internal predecessors, (161), 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-03-17 05:21:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions. [2025-03-17 05:21:44,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 127 [2025-03-17 05:21:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 199 transitions. [2025-03-17 05:21:44,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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-03-17 05:21:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions. [2025-03-17 05:21:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:21:44,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:44,070 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] [2025-03-17 05:21:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:21:44,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:44,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1376615777, now seen corresponding path program 1 times [2025-03-17 05:21:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834426743] [2025-03-17 05:21:44,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:44,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:21:44,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:21:44,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:44,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:44,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834426743] [2025-03-17 05:21:44,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834426743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:44,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:44,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:21:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038122040] [2025-03-17 05:21:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:44,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:44,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:44,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:44,457 INFO L87 Difference]: Start difference. First operand 137 states and 199 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 05:21:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:44,590 INFO L93 Difference]: Finished difference Result 409 states and 595 transitions. [2025-03-17 05:21:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 127 [2025-03-17 05:21:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:44,594 INFO L225 Difference]: With dead ends: 409 [2025-03-17 05:21:44,594 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 05:21:44,595 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-03-17 05:21:44,596 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 80 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 367 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-03-17 05:21:44,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 367 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 05:21:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2025-03-17 05:21:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 224 states have (on average 1.3928571428571428) internal successors, (312), 226 states have internal predecessors, (312), 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-03-17 05:21:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 388 transitions. [2025-03-17 05:21:44,629 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 388 transitions. Word has length 127 [2025-03-17 05:21:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 388 transitions. [2025-03-17 05:21:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 05:21:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2025-03-17 05:21:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:21:44,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:44,632 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] [2025-03-17 05:21:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:21:44,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:44,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -829115167, now seen corresponding path program 1 times [2025-03-17 05:21:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-03-17 05:21:44,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:44,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:21:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:21:44,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:44,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-03-17 05:21:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884732745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223241984] [2025-03-17 05:21:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:45,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:45,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:45,182 INFO L87 Difference]: Start difference. First operand 267 states and 388 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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-03-17 05:21:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:45,288 INFO L93 Difference]: Finished difference Result 643 states and 924 transitions. [2025-03-17 05:21:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:45,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 127 [2025-03-17 05:21:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:45,291 INFO L225 Difference]: With dead ends: 643 [2025-03-17 05:21:45,291 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 05:21:45,292 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-03-17 05:21:45,292 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 66 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:45,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 731 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 05:21:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 207. [2025-03-17 05:21:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 168 states have internal predecessors, (226), 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-03-17 05:21:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 294 transitions. [2025-03-17 05:21:45,333 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 294 transitions. Word has length 127 [2025-03-17 05:21:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 294 transitions. [2025-03-17 05:21:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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-03-17 05:21:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 294 transitions. [2025-03-17 05:21:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:21:45,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:45,335 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] [2025-03-17 05:21:45,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:21:45,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:45,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1407117655, now seen corresponding path program 1 times [2025-03-17 05:21:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405392277] [2025-03-17 05:21:45,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:45,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:21:45,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:21:45,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:45,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:46,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-03-17 05:21:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405392277] [2025-03-17 05:21:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405392277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705871614] [2025-03-17 05:21:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:46,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:46,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:46,065 INFO L87 Difference]: Start difference. First operand 207 states and 294 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 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-03-17 05:21:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:46,467 INFO L93 Difference]: Finished difference Result 443 states and 621 transitions. [2025-03-17 05:21:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:21:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 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 128 [2025-03-17 05:21:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:46,470 INFO L225 Difference]: With dead ends: 443 [2025-03-17 05:21:46,470 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 05:21:46,471 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-03-17 05:21:46,471 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 191 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 846 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-03-17 05:21:46,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 846 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 05:21:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 278. [2025-03-17 05:21:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 231 states have (on average 1.3463203463203464) internal successors, (311), 232 states have internal predecessors, (311), 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-03-17 05:21:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 391 transitions. [2025-03-17 05:21:46,505 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 391 transitions. Word has length 128 [2025-03-17 05:21:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:46,505 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 391 transitions. [2025-03-17 05:21:46,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 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-03-17 05:21:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 391 transitions. [2025-03-17 05:21:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:21:46,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:46,509 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] [2025-03-17 05:21:46,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:21:46,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 100434154, now seen corresponding path program 1 times [2025-03-17 05:21:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-03-17 05:21:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:46,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:21:46,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:21:46,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:46,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-03-17 05:21:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374837587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:47,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706472541] [2025-03-17 05:21:47,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:47,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:47,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:47,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:47,116 INFO L87 Difference]: Start difference. First operand 278 states and 391 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-03-17 05:21:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:47,308 INFO L93 Difference]: Finished difference Result 572 states and 799 transitions. [2025-03-17 05:21:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 128 [2025-03-17 05:21:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:47,310 INFO L225 Difference]: With dead ends: 572 [2025-03-17 05:21:47,310 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 05:21:47,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-03-17 05:21:47,311 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 656 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:47,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 656 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 05:21:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 291. [2025-03-17 05:21:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.348360655737705) internal successors, (329), 245 states have internal predecessors, (329), 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-03-17 05:21:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 409 transitions. [2025-03-17 05:21:47,332 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 409 transitions. Word has length 128 [2025-03-17 05:21:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:47,332 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 409 transitions. [2025-03-17 05:21:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-03-17 05:21:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 409 transitions. [2025-03-17 05:21:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:21:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:47,334 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] [2025-03-17 05:21:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:21:47,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2033707551, now seen corresponding path program 1 times [2025-03-17 05:21:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817663576] [2025-03-17 05:21:47,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:47,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:21:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:21:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:47,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817663576] [2025-03-17 05:21:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817663576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:47,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:47,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:21:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217212657] [2025-03-17 05:21:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:47,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:47,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:47,596 INFO L87 Difference]: Start difference. First operand 291 states and 409 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-17 05:21:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:47,705 INFO L93 Difference]: Finished difference Result 589 states and 826 transitions. [2025-03-17 05:21:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 129 [2025-03-17 05:21:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:47,707 INFO L225 Difference]: With dead ends: 589 [2025-03-17 05:21:47,707 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 05:21:47,708 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-03-17 05:21:47,708 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 363 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-03-17 05:21:47,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 363 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 05:21:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2025-03-17 05:21:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 245 states have internal predecessors, (328), 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-03-17 05:21:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 408 transitions. [2025-03-17 05:21:47,729 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 408 transitions. Word has length 129 [2025-03-17 05:21:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:47,731 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 408 transitions. [2025-03-17 05:21:47,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-17 05:21:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 408 transitions. [2025-03-17 05:21:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:21:47,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:47,733 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] [2025-03-17 05:21:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:21:47,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1664462489, now seen corresponding path program 1 times [2025-03-17 05:21:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37472079] [2025-03-17 05:21:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:47,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:21:47,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:21:47,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37472079] [2025-03-17 05:21:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37472079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:47,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766917282] [2025-03-17 05:21:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:47,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:47,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:47,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:47,952 INFO L87 Difference]: Start difference. First operand 291 states and 408 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03-17 05:21:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:48,128 INFO L93 Difference]: Finished difference Result 589 states and 824 transitions. [2025-03-17 05:21:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 130 [2025-03-17 05:21:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:48,130 INFO L225 Difference]: With dead ends: 589 [2025-03-17 05:21:48,130 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 05:21:48,131 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-03-17 05:21:48,131 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 449 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:48,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 449 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 05:21:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 380. [2025-03-17 05:21:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 313 states have (on average 1.3322683706070289) internal successors, (417), 314 states have internal predecessors, (417), 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-03-17 05:21:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2025-03-17 05:21:48,156 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 130 [2025-03-17 05:21:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2025-03-17 05:21:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03-17 05:21:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2025-03-17 05:21:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:21:48,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:48,159 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] [2025-03-17 05:21:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:21:48,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:48,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1959808296, now seen corresponding path program 1 times [2025-03-17 05:21:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971199617] [2025-03-17 05:21:48,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:48,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:21:48,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:21:48,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:48,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971199617] [2025-03-17 05:21:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971199617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404224664] [2025-03-17 05:21:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:48,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:48,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:48,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:48,325 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03-17 05:21:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:48,508 INFO L93 Difference]: Finished difference Result 693 states and 965 transitions. [2025-03-17 05:21:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 130 [2025-03-17 05:21:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:48,511 INFO L225 Difference]: With dead ends: 693 [2025-03-17 05:21:48,511 INFO L226 Difference]: Without dead ends: 388 [2025-03-17 05:21:48,512 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-03-17 05:21:48,512 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 107 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 516 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:48,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 516 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-17 05:21:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 280. [2025-03-17 05:21:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 233 states have internal predecessors, (305), 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-03-17 05:21:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2025-03-17 05:21:48,531 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 130 [2025-03-17 05:21:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:48,534 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2025-03-17 05:21:48,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03-17 05:21:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2025-03-17 05:21:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:48,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:48,536 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-03-17 05:21:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:21:48,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1044870098, now seen corresponding path program 1 times [2025-03-17 05:21:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680241664] [2025-03-17 05:21:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:48,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:48,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:49,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680241664] [2025-03-17 05:21:49,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680241664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:49,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606635177] [2025-03-17 05:21:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:49,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:49,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:49,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:49,528 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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-03-17 05:21:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:49,879 INFO L93 Difference]: Finished difference Result 797 states and 1087 transitions. [2025-03-17 05:21:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:21:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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 131 [2025-03-17 05:21:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:49,882 INFO L225 Difference]: With dead ends: 797 [2025-03-17 05:21:49,882 INFO L226 Difference]: Without dead ends: 518 [2025-03-17 05:21:49,882 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-03-17 05:21:49,883 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 73 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:49,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 703 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-17 05:21:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 514. [2025-03-17 05:21:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 437 states have (on average 1.3043478260869565) internal successors, (570), 441 states have internal predecessors, (570), 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-03-17 05:21:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 694 transitions. [2025-03-17 05:21:49,922 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 694 transitions. Word has length 131 [2025-03-17 05:21:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 694 transitions. [2025-03-17 05:21:49,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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-03-17 05:21:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 694 transitions. [2025-03-17 05:21:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:49,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:49,926 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-03-17 05:21:49,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:21:49,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:49,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash 114703645, now seen corresponding path program 1 times [2025-03-17 05:21:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301583888] [2025-03-17 05:21:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:49,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:49,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301583888] [2025-03-17 05:21:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301583888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:50,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:50,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:21:50,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009190212] [2025-03-17 05:21:50,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:50,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:21:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:50,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:21:50,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:50,685 INFO L87 Difference]: Start difference. First operand 514 states and 694 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 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-03-17 05:21:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:51,091 INFO L93 Difference]: Finished difference Result 1289 states and 1736 transitions. [2025-03-17 05:21:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:21:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 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-03-17 05:21:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:51,096 INFO L225 Difference]: With dead ends: 1289 [2025-03-17 05:21:51,096 INFO L226 Difference]: Without dead ends: 776 [2025-03-17 05:21:51,097 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-03-17 05:21:51,098 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:51,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1127 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-17 05:21:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 548. [2025-03-17 05:21:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 471 states have (on average 1.3036093418259023) internal successors, (614), 475 states have internal predecessors, (614), 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-03-17 05:21:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 738 transitions. [2025-03-17 05:21:51,141 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 738 transitions. Word has length 131 [2025-03-17 05:21:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:51,141 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 738 transitions. [2025-03-17 05:21:51,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 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-03-17 05:21:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 738 transitions. [2025-03-17 05:21:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:51,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:51,143 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-03-17 05:21:51,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:21:51,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 243786364, now seen corresponding path program 1 times [2025-03-17 05:21:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405235006] [2025-03-17 05:21:51,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:51,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:51,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:51,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405235006] [2025-03-17 05:21:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405235006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705914233] [2025-03-17 05:21:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:51,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:51,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:51,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:51,670 INFO L87 Difference]: Start difference. First operand 548 states and 738 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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-03-17 05:21:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:51,947 INFO L93 Difference]: Finished difference Result 1178 states and 1582 transitions. [2025-03-17 05:21:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:21:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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 131 [2025-03-17 05:21:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:51,951 INFO L225 Difference]: With dead ends: 1178 [2025-03-17 05:21:51,951 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 05:21:51,952 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-03-17 05:21:51,952 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 58 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:51,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 929 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 05:21:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2025-03-17 05:21:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 538 states have (on average 1.3011152416356877) internal successors, (700), 544 states have internal predecessors, (700), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 05:21:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 840 transitions. [2025-03-17 05:21:51,999 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 840 transitions. Word has length 131 [2025-03-17 05:21:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 840 transitions. [2025-03-17 05:21:52,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 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-03-17 05:21:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 840 transitions. [2025-03-17 05:21:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:52,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:52,001 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-03-17 05:21:52,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:21:52,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -294120580, now seen corresponding path program 1 times [2025-03-17 05:21:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948454534] [2025-03-17 05:21:52,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948454534] [2025-03-17 05:21:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948454534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:21:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829277584] [2025-03-17 05:21:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:21:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:21:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:21:52,508 INFO L87 Difference]: Start difference. First operand 627 states and 840 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 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-03-17 05:21:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:52,771 INFO L93 Difference]: Finished difference Result 1273 states and 1694 transitions. [2025-03-17 05:21:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:21:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 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-03-17 05:21:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:52,775 INFO L225 Difference]: With dead ends: 1273 [2025-03-17 05:21:52,775 INFO L226 Difference]: Without dead ends: 647 [2025-03-17 05:21:52,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:52,777 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 59 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:52,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 724 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-17 05:21:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 564. [2025-03-17 05:21:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 483 states have (on average 1.2836438923395446) internal successors, (620), 487 states have internal predecessors, (620), 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-03-17 05:21:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 744 transitions. [2025-03-17 05:21:52,812 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 744 transitions. Word has length 131 [2025-03-17 05:21:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:52,812 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 744 transitions. [2025-03-17 05:21:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 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-03-17 05:21:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 744 transitions. [2025-03-17 05:21:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:52,815 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-03-17 05:21:52,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:21:52,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -165037861, now seen corresponding path program 1 times [2025-03-17 05:21:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860680858] [2025-03-17 05:21:52,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:52,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:52,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:52,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860680858] [2025-03-17 05:21:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860680858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:53,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:21:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358582329] [2025-03-17 05:21:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:53,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:21:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:53,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:21:53,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:21:53,257 INFO L87 Difference]: Start difference. First operand 564 states and 744 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-03-17 05:21:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:53,584 INFO L93 Difference]: Finished difference Result 1223 states and 1607 transitions. [2025-03-17 05:21:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:21:53,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-03-17 05:21:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:53,588 INFO L225 Difference]: With dead ends: 1223 [2025-03-17 05:21:53,588 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 05:21:53,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 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-03-17 05:21:53,589 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 60 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:53,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1203 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 05:21:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 554. [2025-03-17 05:21:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 473 states have (on average 1.276955602536998) internal successors, (604), 477 states have internal predecessors, (604), 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-03-17 05:21:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 728 transitions. [2025-03-17 05:21:53,622 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 728 transitions. Word has length 131 [2025-03-17 05:21:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:53,622 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 728 transitions. [2025-03-17 05:21:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-03-17 05:21:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 728 transitions. [2025-03-17 05:21:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:53,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:53,623 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-03-17 05:21:53,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:21:53,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:53,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1075889905, now seen corresponding path program 1 times [2025-03-17 05:21:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277813036] [2025-03-17 05:21:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:53,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:53,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:53,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:53,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277813036] [2025-03-17 05:21:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277813036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195754015] [2025-03-17 05:21:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:53,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:53,796 INFO L87 Difference]: Start difference. First operand 554 states and 728 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-03-17 05:21:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:53,876 INFO L93 Difference]: Finished difference Result 1113 states and 1463 transitions. [2025-03-17 05:21:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-03-17 05:21:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:53,879 INFO L225 Difference]: With dead ends: 1113 [2025-03-17 05:21:53,879 INFO L226 Difference]: Without dead ends: 560 [2025-03-17 05:21:53,880 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-03-17 05:21:53,881 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:53,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 416 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-17 05:21:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 557. [2025-03-17 05:21:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 480 states have internal predecessors, (607), 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-03-17 05:21:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 731 transitions. [2025-03-17 05:21:53,923 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 731 transitions. Word has length 131 [2025-03-17 05:21:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:53,923 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 731 transitions. [2025-03-17 05:21:53,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-03-17 05:21:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 731 transitions. [2025-03-17 05:21:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:53,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:53,925 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-03-17 05:21:53,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:21:53,925 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash -721061454, now seen corresponding path program 1 times [2025-03-17 05:21:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248962171] [2025-03-17 05:21:53,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:53,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:53,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:53,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:53,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248962171] [2025-03-17 05:21:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248962171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486127712] [2025-03-17 05:21:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:54,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:54,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:54,199 INFO L87 Difference]: Start difference. First operand 557 states and 731 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-03-17 05:21:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:54,309 INFO L93 Difference]: Finished difference Result 1219 states and 1597 transitions. [2025-03-17 05:21:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:54,310 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-03-17 05:21:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:54,313 INFO L225 Difference]: With dead ends: 1219 [2025-03-17 05:21:54,313 INFO L226 Difference]: Without dead ends: 663 [2025-03-17 05:21:54,315 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-03-17 05:21:54,315 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 111 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:54,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 446 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-17 05:21:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 571. [2025-03-17 05:21:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 490 states have (on average 1.2571428571428571) internal successors, (616), 494 states have internal predecessors, (616), 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-03-17 05:21:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 740 transitions. [2025-03-17 05:21:54,347 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 740 transitions. Word has length 131 [2025-03-17 05:21:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:54,348 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 740 transitions. [2025-03-17 05:21:54,348 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-03-17 05:21:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 740 transitions. [2025-03-17 05:21:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:54,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:54,350 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-03-17 05:21:54,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:21:54,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:54,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1990454827, now seen corresponding path program 1 times [2025-03-17 05:21:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:54,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66496377] [2025-03-17 05:21:54,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:54,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:54,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:54,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:54,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:54,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:21:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66496377] [2025-03-17 05:21:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66496377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641040231] [2025-03-17 05:21:54,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:54,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:54,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:21:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:54,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:54,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:21:54,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:54,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641040231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:21:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223109629] [2025-03-17 05:21:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:54,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:21:54,649 INFO L87 Difference]: Start difference. First operand 571 states and 740 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:54,697 INFO L93 Difference]: Finished difference Result 1165 states and 1509 transitions. [2025-03-17 05:21:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:54,700 INFO L225 Difference]: With dead ends: 1165 [2025-03-17 05:21:54,700 INFO L226 Difference]: Without dead ends: 595 [2025-03-17 05:21:54,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 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-03-17 05:21:54,701 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:54,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-17 05:21:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-17 05:21:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 514 states have (on average 1.245136186770428) internal successors, (640), 518 states have internal predecessors, (640), 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-03-17 05:21:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 764 transitions. [2025-03-17 05:21:54,734 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 764 transitions. Word has length 135 [2025-03-17 05:21:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:54,735 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 764 transitions. [2025-03-17 05:21:54,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 764 transitions. [2025-03-17 05:21:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:54,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:54,737 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-03-17 05:21:54,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:21:54,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:21:54,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:54,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash -497058006, now seen corresponding path program 1 times [2025-03-17 05:21:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:54,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748499482] [2025-03-17 05:21:54,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:54,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:54,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:54,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:54,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:54,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748499482] [2025-03-17 05:21:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748499482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620197667] [2025-03-17 05:21:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:55,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:55,119 INFO L87 Difference]: Start difference. First operand 595 states and 764 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-03-17 05:21:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:55,206 INFO L93 Difference]: Finished difference Result 1287 states and 1654 transitions. [2025-03-17 05:21:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:55,206 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-03-17 05:21:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:55,209 INFO L225 Difference]: With dead ends: 1287 [2025-03-17 05:21:55,209 INFO L226 Difference]: Without dead ends: 693 [2025-03-17 05:21:55,210 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-03-17 05:21:55,210 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 97 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:55,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 445 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-17 05:21:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 610. [2025-03-17 05:21:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 529 states have (on average 1.2438563327032137) internal successors, (658), 533 states have internal predecessors, (658), 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-03-17 05:21:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 782 transitions. [2025-03-17 05:21:55,239 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 782 transitions. Word has length 135 [2025-03-17 05:21:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 782 transitions. [2025-03-17 05:21:55,239 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-03-17 05:21:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 782 transitions. [2025-03-17 05:21:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:55,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:55,240 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-03-17 05:21:55,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:21:55,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash 547572526, now seen corresponding path program 1 times [2025-03-17 05:21:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251353108] [2025-03-17 05:21:55,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:55,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:55,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:55,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:55,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:21:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251353108] [2025-03-17 05:21:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251353108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230486311] [2025-03-17 05:21:55,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:55,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:55,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:21:55,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:55,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:55,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:55,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:55,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:21:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:55,627 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-03-17 05:21:55,648 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-03-17 05:21:55,710 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-03-17 05:21:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 268 proven. 30 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-17 05:21:55,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:21:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230486311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:21:55,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:21:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 05:21:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778766800] [2025-03-17 05:21:55,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:21:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:21:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:21:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:21:55,895 INFO L87 Difference]: Start difference. First operand 610 states and 782 transitions. Second operand has 13 states, 10 states have (on average 8.0) internal successors, (80), 13 states have internal predecessors, (80), 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-03-17 05:21:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:56,168 INFO L93 Difference]: Finished difference Result 1207 states and 1530 transitions. [2025-03-17 05:21:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:21:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.0) internal successors, (80), 13 states have internal predecessors, (80), 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 135 [2025-03-17 05:21:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:56,172 INFO L225 Difference]: With dead ends: 1207 [2025-03-17 05:21:56,172 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 05:21:56,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:21:56,174 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 135 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:56,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 328 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 05:21:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 570. [2025-03-17 05:21:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 485 states have (on average 1.2226804123711341) internal successors, (593), 489 states have internal predecessors, (593), 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-03-17 05:21:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 717 transitions. [2025-03-17 05:21:56,202 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 717 transitions. Word has length 135 [2025-03-17 05:21:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 717 transitions. [2025-03-17 05:21:56,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.0) internal successors, (80), 13 states have internal predecessors, (80), 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-03-17 05:21:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 717 transitions. [2025-03-17 05:21:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:56,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:56,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, 1, 1, 1, 1] [2025-03-17 05:21:56,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:56,406 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash -747724464, now seen corresponding path program 1 times [2025-03-17 05:21:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180627785] [2025-03-17 05:21:56,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:56,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:56,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:56,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:56,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180627785] [2025-03-17 05:21:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180627785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197919983] [2025-03-17 05:21:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:56,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:56,668 INFO L87 Difference]: Start difference. First operand 570 states and 717 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:56,842 INFO L93 Difference]: Finished difference Result 1574 states and 1976 transitions. [2025-03-17 05:21:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:56,847 INFO L225 Difference]: With dead ends: 1574 [2025-03-17 05:21:56,847 INFO L226 Difference]: Without dead ends: 1005 [2025-03-17 05:21:56,848 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-03-17 05:21:56,848 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:56,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 464 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-17 05:21:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 720. [2025-03-17 05:21:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 635 states have (on average 1.2393700787401576) internal successors, (787), 639 states have internal predecessors, (787), 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-03-17 05:21:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 911 transitions. [2025-03-17 05:21:56,879 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 911 transitions. Word has length 135 [2025-03-17 05:21:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:56,880 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 911 transitions. [2025-03-17 05:21:56,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03-17 05:21:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 911 transitions. [2025-03-17 05:21:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:56,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:56,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-03-17 05:21:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:21:56,881 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:56,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1739788369, now seen corresponding path program 1 times [2025-03-17 05:21:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781918141] [2025-03-17 05:21:56,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:56,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:56,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:56,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781918141] [2025-03-17 05:21:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781918141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:21:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621645716] [2025-03-17 05:21:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:57,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:21:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:57,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:21:57,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:57,355 INFO L87 Difference]: Start difference. First operand 720 states and 911 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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-03-17 05:21:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:57,699 INFO L93 Difference]: Finished difference Result 1615 states and 2034 transitions. [2025-03-17 05:21:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:21:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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-03-17 05:21:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:57,704 INFO L225 Difference]: With dead ends: 1615 [2025-03-17 05:21:57,704 INFO L226 Difference]: Without dead ends: 896 [2025-03-17 05:21:57,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:21:57,705 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:57,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1175 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-17 05:21:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 724. [2025-03-17 05:21:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 639 states have (on average 1.237871674491393) internal successors, (791), 643 states have internal predecessors, (791), 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-03-17 05:21:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 915 transitions. [2025-03-17 05:21:57,737 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 915 transitions. Word has length 135 [2025-03-17 05:21:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 915 transitions. [2025-03-17 05:21:57,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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-03-17 05:21:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 915 transitions. [2025-03-17 05:21:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:57,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:57,739 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-03-17 05:21:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:21:57,739 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:57,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1843982479, now seen corresponding path program 1 times [2025-03-17 05:21:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915679389] [2025-03-17 05:21:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915679389] [2025-03-17 05:21:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915679389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:58,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:58,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:21:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772611224] [2025-03-17 05:21:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:58,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:21:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:58,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:21:58,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:21:58,062 INFO L87 Difference]: Start difference. First operand 724 states and 915 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03-17 05:21:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:58,235 INFO L93 Difference]: Finished difference Result 1633 states and 2060 transitions. [2025-03-17 05:21:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:21:58,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03-17 05:21:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:58,240 INFO L225 Difference]: With dead ends: 1633 [2025-03-17 05:21:58,240 INFO L226 Difference]: Without dead ends: 910 [2025-03-17 05:21:58,241 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-03-17 05:21:58,243 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 54 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 774 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-17 05:21:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 813. [2025-03-17 05:21:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 722 states have (on average 1.245152354570637) internal successors, (899), 727 states have internal predecessors, (899), 66 states have call successors, (66), 24 states have call predecessors, (66), 24 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:21:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1031 transitions. [2025-03-17 05:21:58,278 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1031 transitions. Word has length 135 [2025-03-17 05:21:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:58,279 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1031 transitions. [2025-03-17 05:21:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03-17 05:21:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1031 transitions. [2025-03-17 05:21:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:58,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:58,280 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-03-17 05:21:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:21:58,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:58,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash -799351947, now seen corresponding path program 1 times [2025-03-17 05:21:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359956518] [2025-03-17 05:21:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:58,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:58,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:58,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:58,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359956518] [2025-03-17 05:21:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359956518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:58,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726589949] [2025-03-17 05:21:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:58,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:58,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:58,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:58,486 INFO L87 Difference]: Start difference. First operand 813 states and 1031 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-03-17 05:21:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:58,619 INFO L93 Difference]: Finished difference Result 1752 states and 2214 transitions. [2025-03-17 05:21:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:58,620 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-03-17 05:21:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:58,623 INFO L225 Difference]: With dead ends: 1752 [2025-03-17 05:21:58,623 INFO L226 Difference]: Without dead ends: 856 [2025-03-17 05:21:58,625 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-03-17 05:21:58,625 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 107 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 560 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-03-17 05:21:58,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 560 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-17 05:21:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 769. [2025-03-17 05:21:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 678 states have (on average 1.2182890855457227) internal successors, (826), 683 states have internal predecessors, (826), 66 states have call successors, (66), 24 states have call predecessors, (66), 24 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:21:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 958 transitions. [2025-03-17 05:21:58,662 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 958 transitions. Word has length 135 [2025-03-17 05:21:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:58,662 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 958 transitions. [2025-03-17 05:21:58,662 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-03-17 05:21:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 958 transitions. [2025-03-17 05:21:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:21:58,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:58,664 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-03-17 05:21:58,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:21:58,664 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:58,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash 708199862, now seen corresponding path program 1 times [2025-03-17 05:21:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668152965] [2025-03-17 05:21:58,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:58,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:21:58,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:21:58,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:58,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:21:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668152965] [2025-03-17 05:21:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668152965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33858221] [2025-03-17 05:21:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:59,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:59,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:59,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:59,214 INFO L87 Difference]: Start difference. First operand 769 states and 958 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-03-17 05:21:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:59,919 INFO L93 Difference]: Finished difference Result 1760 states and 2179 transitions. [2025-03-17 05:21:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:21:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 135 [2025-03-17 05:21:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:59,924 INFO L225 Difference]: With dead ends: 1760 [2025-03-17 05:21:59,924 INFO L226 Difference]: Without dead ends: 992 [2025-03-17 05:21:59,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:21:59,926 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 289 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:59,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 554 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:21:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-17 05:21:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 800. [2025-03-17 05:21:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 703 states have (on average 1.2147937411095306) internal successors, (854), 709 states have internal predecessors, (854), 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-03-17 05:21:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 994 transitions. [2025-03-17 05:21:59,972 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 994 transitions. Word has length 135 [2025-03-17 05:21:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:59,973 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 994 transitions. [2025-03-17 05:21:59,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-03-17 05:21:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 994 transitions. [2025-03-17 05:21:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:21:59,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,974 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] [2025-03-17 05:21:59,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:21:59,974 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1174021448, now seen corresponding path program 1 times [2025-03-17 05:21:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:59,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595456705] [2025-03-17 05:21:59,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:00,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:01,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595456705] [2025-03-17 05:22:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595456705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:01,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 05:22:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19086332] [2025-03-17 05:22:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:22:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:01,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:22:01,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:22:01,869 INFO L87 Difference]: Start difference. First operand 800 states and 994 transitions. Second operand has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 7 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-17 05:22:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:03,635 INFO L93 Difference]: Finished difference Result 1783 states and 2201 transitions. [2025-03-17 05:22:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 7 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 7 states have call successors, (17) Word has length 136 [2025-03-17 05:22:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:03,642 INFO L225 Difference]: With dead ends: 1783 [2025-03-17 05:22:03,642 INFO L226 Difference]: Without dead ends: 984 [2025-03-17 05:22:03,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:22:03,645 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 560 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:03,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 816 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:22:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-03-17 05:22:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 778. [2025-03-17 05:22:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 691 states have (on average 1.2127351664254704) internal successors, (838), 695 states have internal predecessors, (838), 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-03-17 05:22:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 962 transitions. [2025-03-17 05:22:03,695 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 962 transitions. Word has length 136 [2025-03-17 05:22:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:03,696 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 962 transitions. [2025-03-17 05:22:03,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 7 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-17 05:22:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 962 transitions. [2025-03-17 05:22:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:03,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:03,697 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] [2025-03-17 05:22:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:22:03,698 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:03,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash 70743033, now seen corresponding path program 1 times [2025-03-17 05:22:03,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819853929] [2025-03-17 05:22:03,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:03,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:03,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:03,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819853929] [2025-03-17 05:22:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819853929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109695536] [2025-03-17 05:22:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:04,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:04,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:04,174 INFO L87 Difference]: Start difference. First operand 778 states and 962 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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-03-17 05:22:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:04,474 INFO L93 Difference]: Finished difference Result 1673 states and 2064 transitions. [2025-03-17 05:22:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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 136 [2025-03-17 05:22:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:04,480 INFO L225 Difference]: With dead ends: 1673 [2025-03-17 05:22:04,480 INFO L226 Difference]: Without dead ends: 896 [2025-03-17 05:22:04,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:04,482 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:04,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 563 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-17 05:22:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 735. [2025-03-17 05:22:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 648 states have (on average 1.2083333333333333) internal successors, (783), 652 states have internal predecessors, (783), 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-03-17 05:22:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 907 transitions. [2025-03-17 05:22:04,529 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 907 transitions. Word has length 136 [2025-03-17 05:22:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:04,529 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 907 transitions. [2025-03-17 05:22:04,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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-03-17 05:22:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 907 transitions. [2025-03-17 05:22:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:22:04,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:04,531 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] [2025-03-17 05:22:04,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:22:04,531 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 539720169, now seen corresponding path program 1 times [2025-03-17 05:22:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270359011] [2025-03-17 05:22:04,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:22:04,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:22:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:04,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270359011] [2025-03-17 05:22:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270359011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:04,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:22:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048445174] [2025-03-17 05:22:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:04,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:22:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:04,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:22:04,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:04,882 INFO L87 Difference]: Start difference. First operand 735 states and 907 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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-03-17 05:22:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:05,130 INFO L93 Difference]: Finished difference Result 1205 states and 1456 transitions. [2025-03-17 05:22:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:22:05,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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 137 [2025-03-17 05:22:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:05,138 INFO L225 Difference]: With dead ends: 1205 [2025-03-17 05:22:05,138 INFO L226 Difference]: Without dead ends: 1203 [2025-03-17 05:22:05,139 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-03-17 05:22:05,140 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 67 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 991 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-03-17 05:22:05,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 991 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-03-17 05:22:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1199. [2025-03-17 05:22:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1036 states have (on average 1.1756756756756757) internal successors, (1218), 1046 states have internal predecessors, (1218), 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-03-17 05:22:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1446 transitions. [2025-03-17 05:22:05,252 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1446 transitions. Word has length 137 [2025-03-17 05:22:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:05,252 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1446 transitions. [2025-03-17 05:22:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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-03-17 05:22:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1446 transitions. [2025-03-17 05:22:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:22:05,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:05,254 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] [2025-03-17 05:22:05,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:22:05,255 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash 656064971, now seen corresponding path program 1 times [2025-03-17 05:22:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860059135] [2025-03-17 05:22:05,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:05,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:22:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:22:05,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:05,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860059135] [2025-03-17 05:22:05,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860059135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308051261] [2025-03-17 05:22:05,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:05,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:05,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:05,483 INFO L87 Difference]: Start difference. First operand 1199 states and 1446 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 05:22:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:05,637 INFO L93 Difference]: Finished difference Result 2492 states and 3006 transitions. [2025-03-17 05:22:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 137 [2025-03-17 05:22:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:05,642 INFO L225 Difference]: With dead ends: 2492 [2025-03-17 05:22:05,642 INFO L226 Difference]: Without dead ends: 1294 [2025-03-17 05:22:05,644 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-03-17 05:22:05,645 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 90 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:05,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 571 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-03-17 05:22:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1199. [2025-03-17 05:22:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1036 states have (on average 1.16988416988417) internal successors, (1212), 1046 states have internal predecessors, (1212), 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-03-17 05:22:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1440 transitions. [2025-03-17 05:22:05,757 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1440 transitions. Word has length 137 [2025-03-17 05:22:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:05,757 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1440 transitions. [2025-03-17 05:22:05,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 05:22:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1440 transitions. [2025-03-17 05:22:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:22:05,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:05,759 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] [2025-03-17 05:22:05,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:22:05,759 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:05,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1841950966, now seen corresponding path program 1 times [2025-03-17 05:22:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499072607] [2025-03-17 05:22:05,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:05,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:22:05,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:22:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499072607] [2025-03-17 05:22:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499072607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412854271] [2025-03-17 05:22:05,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:05,962 INFO L87 Difference]: Start difference. First operand 1199 states and 1440 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 05:22:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:06,140 INFO L93 Difference]: Finished difference Result 2492 states and 2994 transitions. [2025-03-17 05:22:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 137 [2025-03-17 05:22:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:06,145 INFO L225 Difference]: With dead ends: 2492 [2025-03-17 05:22:06,146 INFO L226 Difference]: Without dead ends: 1294 [2025-03-17 05:22:06,148 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-03-17 05:22:06,148 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 78 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 572 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-03-17 05:22:06,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 572 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-03-17 05:22:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1241. [2025-03-17 05:22:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1078 states have (on average 1.1688311688311688) internal successors, (1260), 1088 states have internal predecessors, (1260), 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-03-17 05:22:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1488 transitions. [2025-03-17 05:22:06,293 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1488 transitions. Word has length 137 [2025-03-17 05:22:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1488 transitions. [2025-03-17 05:22:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 05:22:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1488 transitions. [2025-03-17 05:22:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:06,295 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] [2025-03-17 05:22:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:22:06,296 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -326028747, now seen corresponding path program 1 times [2025-03-17 05:22:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965087958] [2025-03-17 05:22:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:06,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:06,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:06,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965087958] [2025-03-17 05:22:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965087958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:06,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405554690] [2025-03-17 05:22:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:06,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:06,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:06,499 INFO L87 Difference]: Start difference. First operand 1241 states and 1488 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 05:22:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:06,632 INFO L93 Difference]: Finished difference Result 2203 states and 2638 transitions. [2025-03-17 05:22:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 138 [2025-03-17 05:22:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:06,637 INFO L225 Difference]: With dead ends: 2203 [2025-03-17 05:22:06,637 INFO L226 Difference]: Without dead ends: 963 [2025-03-17 05:22:06,640 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-03-17 05:22:06,641 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 534 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:06,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 534 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-17 05:22:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2025-03-17 05:22:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 818 states have (on average 1.1466992665036675) internal successors, (938), 826 states have internal predecessors, (938), 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-03-17 05:22:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1138 transitions. [2025-03-17 05:22:06,717 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1138 transitions. Word has length 138 [2025-03-17 05:22:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1138 transitions. [2025-03-17 05:22:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 05:22:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1138 transitions. [2025-03-17 05:22:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:06,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:06,720 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] [2025-03-17 05:22:06,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:22:06,720 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:06,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 947519387, now seen corresponding path program 1 times [2025-03-17 05:22:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:06,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074727387] [2025-03-17 05:22:06,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074727387] [2025-03-17 05:22:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074727387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170680439] [2025-03-17 05:22:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:07,239 INFO L87 Difference]: Start difference. First operand 961 states and 1138 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 05:22:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:07,841 INFO L93 Difference]: Finished difference Result 2045 states and 2413 transitions. [2025-03-17 05:22:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 138 [2025-03-17 05:22:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:07,846 INFO L225 Difference]: With dead ends: 2045 [2025-03-17 05:22:07,846 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 05:22:07,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-03-17 05:22:07,848 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 45 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 400 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:07,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 400 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 05:22:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 925. [2025-03-17 05:22:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 782 states have (on average 1.1202046035805626) internal successors, (876), 790 states have internal predecessors, (876), 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-03-17 05:22:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1076 transitions. [2025-03-17 05:22:07,995 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1076 transitions. Word has length 138 [2025-03-17 05:22:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:07,996 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1076 transitions. [2025-03-17 05:22:07,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 05:22:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1076 transitions. [2025-03-17 05:22:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:07,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:07,997 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-03-17 05:22:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:22:07,997 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash 210244979, now seen corresponding path program 1 times [2025-03-17 05:22:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119355901] [2025-03-17 05:22:07,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:08,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:08,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119355901] [2025-03-17 05:22:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119355901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093702850] [2025-03-17 05:22:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:08,165 INFO L87 Difference]: Start difference. First operand 925 states and 1076 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-03-17 05:22:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:08,297 INFO L93 Difference]: Finished difference Result 1748 states and 2035 transitions. [2025-03-17 05:22:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:08,297 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-03-17 05:22:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:08,301 INFO L225 Difference]: With dead ends: 1748 [2025-03-17 05:22:08,301 INFO L226 Difference]: Without dead ends: 856 [2025-03-17 05:22:08,302 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-03-17 05:22:08,302 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 118 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 556 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-03-17 05:22:08,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 556 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-17 05:22:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 850. [2025-03-17 05:22:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 707 states have (on average 1.1145685997171146) internal successors, (788), 715 states have internal predecessors, (788), 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-03-17 05:22:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 988 transitions. [2025-03-17 05:22:08,379 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 988 transitions. Word has length 139 [2025-03-17 05:22:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:08,379 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 988 transitions. [2025-03-17 05:22:08,379 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-03-17 05:22:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 988 transitions. [2025-03-17 05:22:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:08,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:08,380 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-03-17 05:22:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:22:08,380 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1446146201, now seen corresponding path program 1 times [2025-03-17 05:22:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369011661] [2025-03-17 05:22:08,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:08,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:08,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369011661] [2025-03-17 05:22:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369011661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:08,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141408432] [2025-03-17 05:22:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:08,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:08,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:08,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:08,571 INFO L87 Difference]: Start difference. First operand 850 states and 988 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-03-17 05:22:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:08,727 INFO L93 Difference]: Finished difference Result 1625 states and 1879 transitions. [2025-03-17 05:22:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 140 [2025-03-17 05:22:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:08,731 INFO L225 Difference]: With dead ends: 1625 [2025-03-17 05:22:08,731 INFO L226 Difference]: Without dead ends: 808 [2025-03-17 05:22:08,732 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-03-17 05:22:08,733 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 32 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 522 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-03-17 05:22:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 522 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-17 05:22:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-03-17 05:22:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 665 states have (on average 1.0857142857142856) internal successors, (722), 673 states have internal predecessors, (722), 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-03-17 05:22:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 922 transitions. [2025-03-17 05:22:08,805 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 922 transitions. Word has length 140 [2025-03-17 05:22:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:08,805 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 922 transitions. [2025-03-17 05:22:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-03-17 05:22:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 922 transitions. [2025-03-17 05:22:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:08,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:08,806 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-03-17 05:22:08,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:22:08,806 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1941093336, now seen corresponding path program 1 times [2025-03-17 05:22:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236259137] [2025-03-17 05:22:08,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:08,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:08,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:08,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:22:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236259137] [2025-03-17 05:22:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236259137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91432406] [2025-03-17 05:22:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:09,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:09,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:09,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:09,461 INFO L87 Difference]: Start difference. First operand 808 states and 922 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 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-03-17 05:22:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:09,864 INFO L93 Difference]: Finished difference Result 1050 states and 1190 transitions. [2025-03-17 05:22:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:22:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 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 140 [2025-03-17 05:22:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:09,875 INFO L225 Difference]: With dead ends: 1050 [2025-03-17 05:22:09,876 INFO L226 Difference]: Without dead ends: 1048 [2025-03-17 05:22:09,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 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-03-17 05:22:09,877 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 62 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1360 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-03-17 05:22:09,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1360 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-03-17 05:22:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1044. [2025-03-17 05:22:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 857 states have (on average 1.0770128354725788) internal successors, (923), 868 states have internal predecessors, (923), 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-03-17 05:22:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1183 transitions. [2025-03-17 05:22:10,038 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1183 transitions. Word has length 140 [2025-03-17 05:22:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:10,039 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1183 transitions. [2025-03-17 05:22:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 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-03-17 05:22:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1183 transitions. [2025-03-17 05:22:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:10,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:10,040 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-03-17 05:22:10,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:22:10,041 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1466370279, now seen corresponding path program 1 times [2025-03-17 05:22:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750414253] [2025-03-17 05:22:10,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:10,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat