./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.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 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:31:13,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:31:13,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:31:13,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:31:13,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:31:13,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:31:13,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:31:13,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:31:13,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:31:13,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:31:13,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:31:13,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:31:13,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:31:13,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:31:13,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:31:13,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:31:13,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:31:13,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:31:13,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:31:13,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:31:13,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:31:13,344 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 -> 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a [2025-03-04 01:31:13,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:31:13,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:31:13,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:31:13,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:31:13,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:31:13,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2025-03-04 01:31:14,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7c932da/b28a7c75a0cf4ad3ada92423e25ba87c/FLAGa48085f37 [2025-03-04 01:31:14,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:31:14,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2025-03-04 01:31:14,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7c932da/b28a7c75a0cf4ad3ada92423e25ba87c/FLAGa48085f37 [2025-03-04 01:31:14,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7c932da/b28a7c75a0cf4ad3ada92423e25ba87c [2025-03-04 01:31:14,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:31:14,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:31:14,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:31:14,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:31:14,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:31:14,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:31:14" (1/1) ... [2025-03-04 01:31:14,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c474a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:14, skipping insertion in model container [2025-03-04 01:31:14,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:31:14" (1/1) ... [2025-03-04 01:31:14,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:31:15,074 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-p_file-66.i[916,929] [2025-03-04 01:31:15,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:31:15,118 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:31:15,125 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-p_file-66.i[916,929] [2025-03-04 01:31:15,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:31:15,171 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:31:15,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15 WrapperNode [2025-03-04 01:31:15,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:31:15,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:31:15,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:31:15,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:31:15,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,226 INFO L138 Inliner]: procedures = 26, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-03-04 01:31:15,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:31:15,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:31:15,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:31:15,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:31:15,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,270 INFO L175 MemorySlicer]: Split 123 memory accesses to 13 slices as follows [2, 7, 10, 8, 14, 8, 16, 8, 8, 14, 8, 13, 7]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1]. [2025-03-04 01:31:15,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:31:15,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:31:15,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:31:15,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:31:15,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (1/1) ... [2025-03-04 01:31:15,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:31:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:31:15,316 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-04 01:31:15,318 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-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:31:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:31:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:31:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:31:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:31:15,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:31:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:31:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:31:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:31:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:31:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:31:15,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:31:15,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:31:15,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:31:15,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-04 01:31:15,836 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:31:15,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:31:15,847 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:31:15,847 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:31:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:31:15 BoogieIcfgContainer [2025-03-04 01:31:15,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:31:15,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:31:15,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:31:15,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:31:15,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:31:14" (1/3) ... [2025-03-04 01:31:15,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd699c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:31:15, skipping insertion in model container [2025-03-04 01:31:15,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:31:15" (2/3) ... [2025-03-04 01:31:15,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd699c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:31:15, skipping insertion in model container [2025-03-04 01:31:15,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:31:15" (3/3) ... [2025-03-04 01:31:15,855 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-66.i [2025-03-04 01:31:15,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:31:15,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:31:15,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:31:15,917 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;@318b5190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:31:15,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:31:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:31:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:31:15,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:15,930 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:15,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:15,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1469854672, now seen corresponding path program 1 times [2025-03-04 01:31:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957811937] [2025-03-04 01:31:15,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:16,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:31:16,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:31:16,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:16,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:31:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957811937] [2025-03-04 01:31:16,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957811937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:31:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43788108] [2025-03-04 01:31:16,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:16,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:31:16,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:31:16,219 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-04 01:31:16,221 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-04 01:31:16,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:31:16,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:31:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:16,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:31:16,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:31:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:31:16,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:31:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43788108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:16,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:31:16,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:31:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979526994] [2025-03-04 01:31:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:31:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:16,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:31:16,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:31:16,438 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:31:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:16,453 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-03-04 01:31:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:31:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-04 01:31:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:16,458 INFO L225 Difference]: With dead ends: 164 [2025-03-04 01:31:16,458 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 01:31:16,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:31:16,462 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:16,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:31:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 01:31:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 01:31:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:31:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-04 01:31:16,488 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-03-04 01:31:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:16,488 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-04 01:31:16,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:31:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-04 01:31:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:31:16,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:16,491 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:16,498 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-04 01:31:16,692 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-04 01:31:16,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1478786114, now seen corresponding path program 1 times [2025-03-04 01:31:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987834511] [2025-03-04 01:31:16,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:16,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:31:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:31:16,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987834511] [2025-03-04 01:31:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987834511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:31:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20263912] [2025-03-04 01:31:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:31:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:31:16,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:31:16,980 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:17,021 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-03-04 01:31:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:31:17,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:31:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:17,024 INFO L225 Difference]: With dead ends: 164 [2025-03-04 01:31:17,025 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 01:31:17,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:31:17,026 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:31:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 01:31:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-04 01:31:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:31:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 01:31:17,040 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-03-04 01:31:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:17,042 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 01:31:17,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 01:31:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:31:17,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:17,045 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:31:17,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1928677501, now seen corresponding path program 1 times [2025-03-04 01:31:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251915191] [2025-03-04 01:31:17,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:31:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:31:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251915191] [2025-03-04 01:31:17,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251915191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:17,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:31:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785239278] [2025-03-04 01:31:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:17,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:31:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:31:17,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:31:17,220 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:17,244 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2025-03-04 01:31:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:31:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:31:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:17,246 INFO L225 Difference]: With dead ends: 168 [2025-03-04 01:31:17,246 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 01:31:17,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:31:17,247 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:17,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:31:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 01:31:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-04 01:31:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:31:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-04 01:31:17,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2025-03-04 01:31:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:17,260 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-04 01:31:17,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-04 01:31:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:31:17,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:17,264 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:31:17,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1927753980, now seen corresponding path program 1 times [2025-03-04 01:31:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764762550] [2025-03-04 01:31:17,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:17,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:31:17,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:31:17,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:17,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764762550] [2025-03-04 01:31:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764762550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:17,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:31:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687531216] [2025-03-04 01:31:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:17,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:31:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:17,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:31:17,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:17,659 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:17,817 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-04 01:31:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:31:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:17,821 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:31:17,821 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:31:17,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:17,824 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 111 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:17,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 571 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:31:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-04 01:31:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.323076923076923) internal successors, (172), 130 states have internal predecessors, (172), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:31:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2025-03-04 01:31:17,846 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 109 [2025-03-04 01:31:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2025-03-04 01:31:17,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2025-03-04 01:31:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:31:17,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:17,848 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:17,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:31:17,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -911179747, now seen corresponding path program 1 times [2025-03-04 01:31:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810737910] [2025-03-04 01:31:17,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:17,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:31:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:31:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810737910] [2025-03-04 01:31:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810737910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:31:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34256768] [2025-03-04 01:31:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:18,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:18,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:31:18,273 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:18,516 INFO L93 Difference]: Finished difference Result 346 states and 483 transitions. [2025-03-04 01:31:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:31:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-04 01:31:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:18,518 INFO L225 Difference]: With dead ends: 346 [2025-03-04 01:31:18,518 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 01:31:18,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:18,519 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 236 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:18,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 452 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 01:31:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 184. [2025-03-04 01:31:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.289655172413793) internal successors, (187), 146 states have internal predecessors, (187), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 255 transitions. [2025-03-04 01:31:18,540 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 255 transitions. Word has length 110 [2025-03-04 01:31:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 255 transitions. [2025-03-04 01:31:18,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 255 transitions. [2025-03-04 01:31:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:31:18,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:18,543 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:31:18,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:18,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2030477852, now seen corresponding path program 1 times [2025-03-04 01:31:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571341097] [2025-03-04 01:31:18,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:18,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:31:18,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:31:18,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571341097] [2025-03-04 01:31:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571341097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:31:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876876190] [2025-03-04 01:31:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:31:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:31:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:31:21,192 INFO L87 Difference]: Start difference. First operand 184 states and 255 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 01:31:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:23,334 INFO L93 Difference]: Finished difference Result 609 states and 840 transitions. [2025-03-04 01:31:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 01:31:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2025-03-04 01:31:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:23,340 INFO L225 Difference]: With dead ends: 609 [2025-03-04 01:31:23,341 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 01:31:23,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 01:31:23,343 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1084 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:23,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1387 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:31:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 01:31:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 206. [2025-03-04 01:31:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 165 states have internal predecessors, (210), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 278 transitions. [2025-03-04 01:31:23,371 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 278 transitions. Word has length 110 [2025-03-04 01:31:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:23,372 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 278 transitions. [2025-03-04 01:31:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 01:31:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 278 transitions. [2025-03-04 01:31:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:31:23,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:23,373 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:31:23,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1737074845, now seen corresponding path program 1 times [2025-03-04 01:31:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905159914] [2025-03-04 01:31:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:23,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:31:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:31:23,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:23,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905159914] [2025-03-04 01:31:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905159914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:31:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153773865] [2025-03-04 01:31:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:31:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:23,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:31:23,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:23,959 INFO L87 Difference]: Start difference. First operand 206 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:24,798 INFO L93 Difference]: Finished difference Result 429 states and 577 transitions. [2025-03-04 01:31:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:31:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2025-03-04 01:31:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:24,801 INFO L225 Difference]: With dead ends: 429 [2025-03-04 01:31:24,801 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 01:31:24,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:31:24,802 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 497 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:24,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 765 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:31:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 01:31:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 208. [2025-03-04 01:31:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 167 states have internal predecessors, (212), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2025-03-04 01:31:24,826 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 110 [2025-03-04 01:31:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:24,827 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2025-03-04 01:31:24,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2025-03-04 01:31:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:31:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:24,830 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:24,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:31:24,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash 664688935, now seen corresponding path program 1 times [2025-03-04 01:31:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363251381] [2025-03-04 01:31:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:24,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:31:24,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:31:24,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:24,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363251381] [2025-03-04 01:31:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363251381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:31:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706755125] [2025-03-04 01:31:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:31:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:25,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:31:25,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:25,128 INFO L87 Difference]: Start difference. First operand 208 states and 280 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:25,264 INFO L93 Difference]: Finished difference Result 402 states and 543 transitions. [2025-03-04 01:31:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:25,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:31:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:25,265 INFO L225 Difference]: With dead ends: 402 [2025-03-04 01:31:25,267 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:31:25,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:25,268 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 103 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:25,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 587 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:31:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 206. [2025-03-04 01:31:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 165 states have internal predecessors, (208), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2025-03-04 01:31:25,287 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 111 [2025-03-04 01:31:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:25,287 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2025-03-04 01:31:25,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2025-03-04 01:31:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:31:25,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:25,288 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:25,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:31:25,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:25,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1660016640, now seen corresponding path program 1 times [2025-03-04 01:31:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864110466] [2025-03-04 01:31:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:31:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:31:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864110466] [2025-03-04 01:31:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864110466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:31:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122338065] [2025-03-04 01:31:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:25,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:25,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:31:25,485 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:25,634 INFO L93 Difference]: Finished difference Result 383 states and 514 transitions. [2025-03-04 01:31:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-04 01:31:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:25,637 INFO L225 Difference]: With dead ends: 383 [2025-03-04 01:31:25,637 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:31:25,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:25,638 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 95 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:25,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 371 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:31:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 204. [2025-03-04 01:31:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 163 states have internal predecessors, (205), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2025-03-04 01:31:25,668 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 112 [2025-03-04 01:31:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:25,669 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2025-03-04 01:31:25,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2025-03-04 01:31:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:31:25,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:25,670 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:25,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:31:25,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 510456538, now seen corresponding path program 1 times [2025-03-04 01:31:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743384332] [2025-03-04 01:31:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:25,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:31:25,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:31:25,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:25,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:31:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743384332] [2025-03-04 01:31:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743384332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:31:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535321913] [2025-03-04 01:31:25,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:31:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:31:25,782 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-04 01:31:25,784 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-04 01:31:25,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:31:25,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:31:25,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:25,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:25,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:31:25,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:31:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:25,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:31:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535321913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:25,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:31:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:31:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848476674] [2025-03-04 01:31:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:25,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:25,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:25,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:25,954 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:26,018 INFO L93 Difference]: Finished difference Result 394 states and 529 transitions. [2025-03-04 01:31:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:31:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:26,019 INFO L225 Difference]: With dead ends: 394 [2025-03-04 01:31:26,019 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 01:31:26,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:26,021 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:31:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 01:31:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-04 01:31:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.255952380952381) internal successors, (211), 169 states have internal predecessors, (211), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:31:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 279 transitions. [2025-03-04 01:31:26,057 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 279 transitions. Word has length 113 [2025-03-04 01:31:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:26,058 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 279 transitions. [2025-03-04 01:31:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 279 transitions. [2025-03-04 01:31:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:31:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:26,059 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:26,066 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-04 01:31:26,259 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,SelfDestructingSolverStorable9 [2025-03-04 01:31:26,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash -124147616, now seen corresponding path program 1 times [2025-03-04 01:31:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:26,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380816952] [2025-03-04 01:31:26,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:26,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:31:26,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:31:26,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:26,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380816952] [2025-03-04 01:31:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380816952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:31:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525231086] [2025-03-04 01:31:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:26,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:31:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:26,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:31:26,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:26,645 INFO L87 Difference]: Start difference. First operand 210 states and 279 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:27,082 INFO L93 Difference]: Finished difference Result 512 states and 682 transitions. [2025-03-04 01:31:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:31:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:31:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:27,085 INFO L225 Difference]: With dead ends: 512 [2025-03-04 01:31:27,085 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 01:31:27,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:27,086 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 309 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 755 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 01:31:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 242. [2025-03-04 01:31:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.256544502617801) internal successors, (240), 192 states have internal predecessors, (240), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:31:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 324 transitions. [2025-03-04 01:31:27,116 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 324 transitions. Word has length 113 [2025-03-04 01:31:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:27,117 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 324 transitions. [2025-03-04 01:31:27,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 324 transitions. [2025-03-04 01:31:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:31:27,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:27,118 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:27,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:31:27,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:27,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -417550623, now seen corresponding path program 1 times [2025-03-04 01:31:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:27,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919172735] [2025-03-04 01:31:27,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:27,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:31:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:31:27,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919172735] [2025-03-04 01:31:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919172735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:27,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:31:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031219745] [2025-03-04 01:31:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:27,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:31:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:27,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:31:27,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:31:27,602 INFO L87 Difference]: Start difference. First operand 242 states and 324 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:27,855 INFO L93 Difference]: Finished difference Result 396 states and 534 transitions. [2025-03-04 01:31:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:31:27,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-03-04 01:31:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:27,860 INFO L225 Difference]: With dead ends: 396 [2025-03-04 01:31:27,860 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:31:27,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:31:27,861 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 175 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:27,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 677 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:31:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 242. [2025-03-04 01:31:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.256544502617801) internal successors, (240), 192 states have internal predecessors, (240), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:31:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 324 transitions. [2025-03-04 01:31:27,897 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 324 transitions. Word has length 113 [2025-03-04 01:31:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:27,897 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 324 transitions. [2025-03-04 01:31:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 324 transitions. [2025-03-04 01:31:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:31:27,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:27,899 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:31:27,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 87203297, now seen corresponding path program 1 times [2025-03-04 01:31:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539868435] [2025-03-04 01:31:27,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:27,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:31:27,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:31:27,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:27,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:28,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539868435] [2025-03-04 01:31:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539868435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170224573] [2025-03-04 01:31:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:28,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:28,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:28,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:28,214 INFO L87 Difference]: Start difference. First operand 242 states and 324 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:28,549 INFO L93 Difference]: Finished difference Result 435 states and 582 transitions. [2025-03-04 01:31:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:31:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:31:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:28,552 INFO L225 Difference]: With dead ends: 435 [2025-03-04 01:31:28,552 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 01:31:28,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:31:28,553 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 222 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 621 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 01:31:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 228. [2025-03-04 01:31:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 177 states have (on average 1.231638418079096) internal successors, (218), 178 states have internal predecessors, (218), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:31:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 302 transitions. [2025-03-04 01:31:28,580 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 302 transitions. Word has length 113 [2025-03-04 01:31:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:28,580 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 302 transitions. [2025-03-04 01:31:28,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 302 transitions. [2025-03-04 01:31:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:31:28,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:28,581 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:28,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:31:28,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:28,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 623297436, now seen corresponding path program 1 times [2025-03-04 01:31:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223751779] [2025-03-04 01:31:28,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:28,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:31:28,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:31:28,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:28,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223751779] [2025-03-04 01:31:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223751779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:31:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192054146] [2025-03-04 01:31:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:31:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:28,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:31:28,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:31:28,986 INFO L87 Difference]: Start difference. First operand 228 states and 302 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:29,455 INFO L93 Difference]: Finished difference Result 521 states and 696 transitions. [2025-03-04 01:31:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:31:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-04 01:31:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:29,457 INFO L225 Difference]: With dead ends: 521 [2025-03-04 01:31:29,458 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 01:31:29,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:31:29,459 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 703 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:29,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 663 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 01:31:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 264. [2025-03-04 01:31:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 213 states have (on average 1.2629107981220657) internal successors, (269), 214 states have internal predecessors, (269), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:31:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2025-03-04 01:31:29,486 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 115 [2025-03-04 01:31:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:29,487 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2025-03-04 01:31:29,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2025-03-04 01:31:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:31:29,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:29,488 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:31:29,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2130849245, now seen corresponding path program 1 times [2025-03-04 01:31:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437360165] [2025-03-04 01:31:29,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:29,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:31:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:31:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437360165] [2025-03-04 01:31:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437360165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313951030] [2025-03-04 01:31:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:30,029 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:30,545 INFO L93 Difference]: Finished difference Result 509 states and 669 transitions. [2025-03-04 01:31:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:31:30,545 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-04 01:31:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:30,547 INFO L225 Difference]: With dead ends: 509 [2025-03-04 01:31:30,547 INFO L226 Difference]: Without dead ends: 407 [2025-03-04 01:31:30,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:31:30,549 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 403 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:30,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 988 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-04 01:31:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 240. [2025-03-04 01:31:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:31:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2025-03-04 01:31:30,580 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 115 [2025-03-04 01:31:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:30,580 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2025-03-04 01:31:30,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2025-03-04 01:31:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:31:30,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:30,581 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:31:30,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1845700270, now seen corresponding path program 1 times [2025-03-04 01:31:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243715401] [2025-03-04 01:31:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:30,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:31:30,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:31:30,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:30,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243715401] [2025-03-04 01:31:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243715401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:30,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:31:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081852599] [2025-03-04 01:31:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:31:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:30,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:31:30,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:30,828 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:31,003 INFO L93 Difference]: Finished difference Result 550 states and 737 transitions. [2025-03-04 01:31:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:31,004 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), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2025-03-04 01:31:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:31,006 INFO L225 Difference]: With dead ends: 550 [2025-03-04 01:31:31,006 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 01:31:31,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:31,007 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 314 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:31,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 496 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 01:31:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2025-03-04 01:31:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 268 states have (on average 1.3022388059701493) internal successors, (349), 269 states have internal predecessors, (349), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:31:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 413 transitions. [2025-03-04 01:31:31,033 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 413 transitions. Word has length 116 [2025-03-04 01:31:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 413 transitions. [2025-03-04 01:31:31,033 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), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 413 transitions. [2025-03-04 01:31:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:31:31,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:31,034 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:31,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:31:31,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash -959316212, now seen corresponding path program 1 times [2025-03-04 01:31:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826693850] [2025-03-04 01:31:31,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:31:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:31:31,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:31,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826693850] [2025-03-04 01:31:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826693850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:31:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423346992] [2025-03-04 01:31:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:31,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:31,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:31:31,161 INFO L87 Difference]: Start difference. First operand 310 states and 413 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:31,235 INFO L93 Difference]: Finished difference Result 619 states and 824 transitions. [2025-03-04 01:31:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:31:31,235 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:31:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:31,238 INFO L225 Difference]: With dead ends: 619 [2025-03-04 01:31:31,238 INFO L226 Difference]: Without dead ends: 312 [2025-03-04 01:31:31,239 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-04 01:31:31,239 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 108 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:31,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 444 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:31:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-04 01:31:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2025-03-04 01:31:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 268 states have (on average 1.2985074626865671) internal successors, (348), 269 states have internal predecessors, (348), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:31:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2025-03-04 01:31:31,268 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 116 [2025-03-04 01:31:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2025-03-04 01:31:31,268 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2025-03-04 01:31:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:31:31,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:31,269 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:31:31,270 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:31,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash -338148461, now seen corresponding path program 1 times [2025-03-04 01:31:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156908862] [2025-03-04 01:31:31,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:31:31,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:31:31,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:31,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:31,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156908862] [2025-03-04 01:31:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156908862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:31:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822380022] [2025-03-04 01:31:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:31:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:31:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:31,502 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:31,677 INFO L93 Difference]: Finished difference Result 594 states and 786 transitions. [2025-03-04 01:31:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:31,677 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), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-04 01:31:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:31,679 INFO L225 Difference]: With dead ends: 594 [2025-03-04 01:31:31,679 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 01:31:31,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:31,680 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 229 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:31,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 524 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 01:31:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2025-03-04 01:31:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 243 states have internal predecessors, (309), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:31:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 373 transitions. [2025-03-04 01:31:31,707 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 373 transitions. Word has length 116 [2025-03-04 01:31:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:31,707 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 373 transitions. [2025-03-04 01:31:31,707 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), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 373 transitions. [2025-03-04 01:31:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:31:31,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:31,709 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:31:31,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:31,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -366055527, now seen corresponding path program 1 times [2025-03-04 01:31:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493914134] [2025-03-04 01:31:31,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:31,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:31:31,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:31:31,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:31,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:32,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493914134] [2025-03-04 01:31:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493914134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:32,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121747317] [2025-03-04 01:31:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:32,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:32,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:32,018 INFO L87 Difference]: Start difference. First operand 284 states and 373 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:32,165 INFO L93 Difference]: Finished difference Result 321 states and 415 transitions. [2025-03-04 01:31:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-04 01:31:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:32,167 INFO L225 Difference]: With dead ends: 321 [2025-03-04 01:31:32,167 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 01:31:32,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:31:32,168 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 69 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:32,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 622 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 01:31:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 293. [2025-03-04 01:31:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 251 states have (on average 1.2669322709163346) internal successors, (318), 252 states have internal predecessors, (318), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:31:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 382 transitions. [2025-03-04 01:31:32,207 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 382 transitions. Word has length 117 [2025-03-04 01:31:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 382 transitions. [2025-03-04 01:31:32,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 382 transitions. [2025-03-04 01:31:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:31:32,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:32,209 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:31:32,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:32,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -365132006, now seen corresponding path program 1 times [2025-03-04 01:31:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446961883] [2025-03-04 01:31:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:32,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:31:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:31:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:32,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446961883] [2025-03-04 01:31:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446961883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:32,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:32,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025840350] [2025-03-04 01:31:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:32,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:32,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:32,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:32,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:32,768 INFO L87 Difference]: Start difference. First operand 293 states and 382 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:33,438 INFO L93 Difference]: Finished difference Result 670 states and 866 transitions. [2025-03-04 01:31:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:31:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-04 01:31:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:33,441 INFO L225 Difference]: With dead ends: 670 [2025-03-04 01:31:33,441 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 01:31:33,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:31:33,442 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 352 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:33,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 888 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 01:31:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 338. [2025-03-04 01:31:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 279 states have (on average 1.2293906810035842) internal successors, (343), 281 states have internal predecessors, (343), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:31:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 431 transitions. [2025-03-04 01:31:33,483 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 431 transitions. Word has length 117 [2025-03-04 01:31:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 431 transitions. [2025-03-04 01:31:33,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 431 transitions. [2025-03-04 01:31:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:31:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:33,485 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:31:33,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 522371675, now seen corresponding path program 1 times [2025-03-04 01:31:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30444346] [2025-03-04 01:31:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:31:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:31:33,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:33,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30444346] [2025-03-04 01:31:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30444346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:31:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772405155] [2025-03-04 01:31:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:31:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:31:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:31:33,829 INFO L87 Difference]: Start difference. First operand 338 states and 431 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:34,062 INFO L93 Difference]: Finished difference Result 619 states and 787 transitions. [2025-03-04 01:31:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:31:34,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-04 01:31:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:34,065 INFO L225 Difference]: With dead ends: 619 [2025-03-04 01:31:34,066 INFO L226 Difference]: Without dead ends: 442 [2025-03-04 01:31:34,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:31:34,067 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 182 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:34,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 678 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-04 01:31:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 400. [2025-03-04 01:31:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 341 states have (on average 1.2258064516129032) internal successors, (418), 343 states have internal predecessors, (418), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:31:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 506 transitions. [2025-03-04 01:31:34,105 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 506 transitions. Word has length 117 [2025-03-04 01:31:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:34,105 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 506 transitions. [2025-03-04 01:31:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 506 transitions. [2025-03-04 01:31:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:31:34,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:34,107 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:31:34,107 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:34,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -596293004, now seen corresponding path program 1 times [2025-03-04 01:31:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197449703] [2025-03-04 01:31:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:34,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:31:34,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:31:34,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:34,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197449703] [2025-03-04 01:31:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197449703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:34,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:31:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332841142] [2025-03-04 01:31:34,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:34,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:31:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:34,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:31:34,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:31:34,456 INFO L87 Difference]: Start difference. First operand 400 states and 506 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:34,912 INFO L93 Difference]: Finished difference Result 739 states and 938 transitions. [2025-03-04 01:31:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:31:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-04 01:31:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:34,914 INFO L225 Difference]: With dead ends: 739 [2025-03-04 01:31:34,914 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 01:31:34,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:31:34,916 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 424 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:34,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 741 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 01:31:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 412. [2025-03-04 01:31:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 350 states have (on average 1.22) internal successors, (427), 352 states have internal predecessors, (427), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 519 transitions. [2025-03-04 01:31:34,972 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 519 transitions. Word has length 118 [2025-03-04 01:31:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:34,973 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 519 transitions. [2025-03-04 01:31:34,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 519 transitions. [2025-03-04 01:31:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:31:34,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:34,974 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:34,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:31:34,974 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:34,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash -551360009, now seen corresponding path program 1 times [2025-03-04 01:31:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:34,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704114001] [2025-03-04 01:31:34,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:34,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:31:35,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:31:35,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:35,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704114001] [2025-03-04 01:31:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704114001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622081216] [2025-03-04 01:31:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:35,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:35,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:35,367 INFO L87 Difference]: Start difference. First operand 412 states and 519 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:36,060 INFO L93 Difference]: Finished difference Result 806 states and 1019 transitions. [2025-03-04 01:31:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:31:36,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-04 01:31:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:36,063 INFO L225 Difference]: With dead ends: 806 [2025-03-04 01:31:36,063 INFO L226 Difference]: Without dead ends: 581 [2025-03-04 01:31:36,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:31:36,065 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 535 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:36,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 952 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-04 01:31:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 416. [2025-03-04 01:31:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 354 states have (on average 1.2231638418079096) internal successors, (433), 356 states have internal predecessors, (433), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 525 transitions. [2025-03-04 01:31:36,118 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 525 transitions. Word has length 118 [2025-03-04 01:31:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:36,119 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 525 transitions. [2025-03-04 01:31:36,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 525 transitions. [2025-03-04 01:31:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:31:36,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:36,121 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:31:36,121 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:36,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash 956191800, now seen corresponding path program 1 times [2025-03-04 01:31:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608414460] [2025-03-04 01:31:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:36,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:31:36,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:31:36,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608414460] [2025-03-04 01:31:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608414460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:31:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253734563] [2025-03-04 01:31:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:36,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:31:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:36,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:31:36,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:31:36,462 INFO L87 Difference]: Start difference. First operand 416 states and 525 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:37,003 INFO L93 Difference]: Finished difference Result 785 states and 997 transitions. [2025-03-04 01:31:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:31:37,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-04 01:31:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:37,005 INFO L225 Difference]: With dead ends: 785 [2025-03-04 01:31:37,005 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 01:31:37,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:31:37,007 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 342 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:37,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 788 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 01:31:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 444. [2025-03-04 01:31:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 382 states have (on average 1.2303664921465969) internal successors, (470), 384 states have internal predecessors, (470), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 562 transitions. [2025-03-04 01:31:37,048 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 562 transitions. Word has length 118 [2025-03-04 01:31:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 562 transitions. [2025-03-04 01:31:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 562 transitions. [2025-03-04 01:31:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:31:37,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:37,050 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:31:37,050 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 987211607, now seen corresponding path program 1 times [2025-03-04 01:31:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256478566] [2025-03-04 01:31:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:37,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:31:37,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:31:37,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:37,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256478566] [2025-03-04 01:31:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256478566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:37,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:37,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:31:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474846677] [2025-03-04 01:31:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:37,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:31:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:37,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:31:37,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:37,434 INFO L87 Difference]: Start difference. First operand 444 states and 562 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:38,017 INFO L93 Difference]: Finished difference Result 757 states and 957 transitions. [2025-03-04 01:31:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:31:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-04 01:31:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:38,020 INFO L225 Difference]: With dead ends: 757 [2025-03-04 01:31:38,020 INFO L226 Difference]: Without dead ends: 528 [2025-03-04 01:31:38,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:31:38,021 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 438 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:38,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 833 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-04 01:31:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 412. [2025-03-04 01:31:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 350 states have (on average 1.22) internal successors, (427), 352 states have internal predecessors, (427), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 519 transitions. [2025-03-04 01:31:38,067 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 519 transitions. Word has length 118 [2025-03-04 01:31:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:38,067 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 519 transitions. [2025-03-04 01:31:38,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 519 transitions. [2025-03-04 01:31:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:31:38,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:38,070 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:31:38,070 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1316339096, now seen corresponding path program 1 times [2025-03-04 01:31:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143394070] [2025-03-04 01:31:38,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:31:38,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:31:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:38,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143394070] [2025-03-04 01:31:38,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143394070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:38,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:38,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:31:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776085853] [2025-03-04 01:31:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:38,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:31:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:38,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:31:38,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:38,386 INFO L87 Difference]: Start difference. First operand 412 states and 519 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:38,615 INFO L93 Difference]: Finished difference Result 695 states and 876 transitions. [2025-03-04 01:31:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-04 01:31:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:38,617 INFO L225 Difference]: With dead ends: 695 [2025-03-04 01:31:38,617 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 01:31:38,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:38,618 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 170 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:38,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 499 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 01:31:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 412. [2025-03-04 01:31:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 350 states have (on average 1.2142857142857142) internal successors, (425), 352 states have internal predecessors, (425), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 517 transitions. [2025-03-04 01:31:38,656 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 517 transitions. Word has length 119 [2025-03-04 01:31:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:38,656 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 517 transitions. [2025-03-04 01:31:38,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 517 transitions. [2025-03-04 01:31:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:31:38,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:38,657 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:38,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:31:38,658 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 832889151, now seen corresponding path program 1 times [2025-03-04 01:31:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867226989] [2025-03-04 01:31:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:38,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:31:38,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:31:38,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867226989] [2025-03-04 01:31:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867226989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:39,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:31:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880100445] [2025-03-04 01:31:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:39,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:31:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:31:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:31:39,644 INFO L87 Difference]: Start difference. First operand 412 states and 517 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:40,556 INFO L93 Difference]: Finished difference Result 877 states and 1096 transitions. [2025-03-04 01:31:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:31:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-04 01:31:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:40,559 INFO L225 Difference]: With dead ends: 877 [2025-03-04 01:31:40,559 INFO L226 Difference]: Without dead ends: 513 [2025-03-04 01:31:40,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:31:40,560 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 403 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:40,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1269 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:31:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-04 01:31:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 428. [2025-03-04 01:31:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 366 states have (on average 1.210382513661202) internal successors, (443), 368 states have internal predecessors, (443), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 535 transitions. [2025-03-04 01:31:40,599 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 535 transitions. Word has length 119 [2025-03-04 01:31:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 535 transitions. [2025-03-04 01:31:40,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 535 transitions. [2025-03-04 01:31:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:31:40,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:40,601 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:40,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:31:40,601 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -964062208, now seen corresponding path program 1 times [2025-03-04 01:31:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714571321] [2025-03-04 01:31:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:40,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:31:40,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:31:40,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:40,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714571321] [2025-03-04 01:31:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714571321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:40,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:31:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822888271] [2025-03-04 01:31:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:40,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:31:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:40,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:31:40,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:31:40,849 INFO L87 Difference]: Start difference. First operand 428 states and 535 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:41,076 INFO L93 Difference]: Finished difference Result 972 states and 1217 transitions. [2025-03-04 01:31:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:31:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:41,079 INFO L225 Difference]: With dead ends: 972 [2025-03-04 01:31:41,079 INFO L226 Difference]: Without dead ends: 592 [2025-03-04 01:31:41,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:41,080 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 336 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 703 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-04 01:31:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 546. [2025-03-04 01:31:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 484 states have (on average 1.2231404958677685) internal successors, (592), 485 states have internal predecessors, (592), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 684 transitions. [2025-03-04 01:31:41,133 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 684 transitions. Word has length 119 [2025-03-04 01:31:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:41,134 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 684 transitions. [2025-03-04 01:31:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 684 transitions. [2025-03-04 01:31:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:31:41,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:41,135 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:41,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:31:41,135 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653632, now seen corresponding path program 1 times [2025-03-04 01:31:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468959778] [2025-03-04 01:31:41,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:41,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:31:41,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:31:41,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:41,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468959778] [2025-03-04 01:31:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468959778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434917847] [2025-03-04 01:31:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:41,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:41,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:41,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:41,389 INFO L87 Difference]: Start difference. First operand 546 states and 684 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:41,566 INFO L93 Difference]: Finished difference Result 1006 states and 1257 transitions. [2025-03-04 01:31:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:31:41,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:31:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:41,569 INFO L225 Difference]: With dead ends: 1006 [2025-03-04 01:31:41,569 INFO L226 Difference]: Without dead ends: 580 [2025-03-04 01:31:41,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:41,570 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 170 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:41,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 561 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-04 01:31:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 544. [2025-03-04 01:31:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 482 states have (on average 1.2136929460580912) internal successors, (585), 483 states have internal predecessors, (585), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 677 transitions. [2025-03-04 01:31:41,612 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 677 transitions. Word has length 119 [2025-03-04 01:31:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:41,613 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 677 transitions. [2025-03-04 01:31:41,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 677 transitions. [2025-03-04 01:31:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:31:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:41,613 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:41,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:31:41,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 871532946, now seen corresponding path program 1 times [2025-03-04 01:31:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083591217] [2025-03-04 01:31:41,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:41,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:31:41,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:31:41,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:41,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083591217] [2025-03-04 01:31:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083591217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:31:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224935753] [2025-03-04 01:31:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:31:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:41,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:31:41,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:31:41,965 INFO L87 Difference]: Start difference. First operand 544 states and 677 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:42,258 INFO L93 Difference]: Finished difference Result 818 states and 1017 transitions. [2025-03-04 01:31:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:31:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-04 01:31:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:42,260 INFO L225 Difference]: With dead ends: 818 [2025-03-04 01:31:42,260 INFO L226 Difference]: Without dead ends: 585 [2025-03-04 01:31:42,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:31:42,261 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 288 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:42,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 543 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-04 01:31:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 514. [2025-03-04 01:31:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 452 states have (on average 1.2101769911504425) internal successors, (547), 453 states have internal predecessors, (547), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:31:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 639 transitions. [2025-03-04 01:31:42,311 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 639 transitions. Word has length 120 [2025-03-04 01:31:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:42,311 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 639 transitions. [2025-03-04 01:31:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 639 transitions. [2025-03-04 01:31:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:31:42,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:42,312 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:42,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:31:42,312 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1574363162, now seen corresponding path program 1 times [2025-03-04 01:31:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419069103] [2025-03-04 01:31:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:42,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:31:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:31:42,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:42,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419069103] [2025-03-04 01:31:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419069103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:42,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:31:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887130448] [2025-03-04 01:31:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:31:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:42,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:31:42,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:42,904 INFO L87 Difference]: Start difference. First operand 514 states and 639 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:43,221 INFO L93 Difference]: Finished difference Result 947 states and 1185 transitions. [2025-03-04 01:31:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:31:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:31:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:43,224 INFO L225 Difference]: With dead ends: 947 [2025-03-04 01:31:43,224 INFO L226 Difference]: Without dead ends: 715 [2025-03-04 01:31:43,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:31:43,225 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 84 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:43,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1500 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-04 01:31:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 694. [2025-03-04 01:31:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 621 states have (on average 1.2254428341384862) internal successors, (761), 623 states have internal predecessors, (761), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 869 transitions. [2025-03-04 01:31:43,279 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 869 transitions. Word has length 121 [2025-03-04 01:31:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:43,279 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 869 transitions. [2025-03-04 01:31:43,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 869 transitions. [2025-03-04 01:31:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:31:43,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:43,280 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:43,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:31:43,281 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:43,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1570072885, now seen corresponding path program 1 times [2025-03-04 01:31:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:43,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928961385] [2025-03-04 01:31:43,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:31:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:31:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928961385] [2025-03-04 01:31:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928961385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314433001] [2025-03-04 01:31:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:43,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:43,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:43,543 INFO L87 Difference]: Start difference. First operand 694 states and 869 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:43,786 INFO L93 Difference]: Finished difference Result 1396 states and 1742 transitions. [2025-03-04 01:31:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:43,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:31:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:43,789 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 01:31:43,789 INFO L226 Difference]: Without dead ends: 1051 [2025-03-04 01:31:43,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-04 01:31:43,790 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:43,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1056 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-04 01:31:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 797. [2025-03-04 01:31:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 724 states have (on average 1.227900552486188) internal successors, (889), 726 states have internal predecessors, (889), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 997 transitions. [2025-03-04 01:31:43,872 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 997 transitions. Word has length 122 [2025-03-04 01:31:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:43,872 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 997 transitions. [2025-03-04 01:31:43,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 997 transitions. [2025-03-04 01:31:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:43,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:43,873 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:43,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:31:43,874 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:43,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 494669239, now seen corresponding path program 1 times [2025-03-04 01:31:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485234339] [2025-03-04 01:31:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:43,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:43,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485234339] [2025-03-04 01:31:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485234339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174668341] [2025-03-04 01:31:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:44,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:44,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:44,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:44,473 INFO L87 Difference]: Start difference. First operand 797 states and 997 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:45,648 INFO L93 Difference]: Finished difference Result 1599 states and 2024 transitions. [2025-03-04 01:31:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:31:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 01:31:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:45,652 INFO L225 Difference]: With dead ends: 1599 [2025-03-04 01:31:45,652 INFO L226 Difference]: Without dead ends: 1167 [2025-03-04 01:31:45,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:31:45,653 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 482 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:45,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1233 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:31:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-03-04 01:31:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 908. [2025-03-04 01:31:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 835 states have (on average 1.244311377245509) internal successors, (1039), 837 states have internal predecessors, (1039), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1147 transitions. [2025-03-04 01:31:45,749 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1147 transitions. Word has length 123 [2025-03-04 01:31:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1147 transitions. [2025-03-04 01:31:45,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1147 transitions. [2025-03-04 01:31:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:45,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:45,750 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:45,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:31:45,750 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1847978936, now seen corresponding path program 1 times [2025-03-04 01:31:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547258414] [2025-03-04 01:31:45,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:45,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:45,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:45,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547258414] [2025-03-04 01:31:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547258414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:45,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:45,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:31:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712771547] [2025-03-04 01:31:45,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:45,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:45,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:45,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:31:45,943 INFO L87 Difference]: Start difference. First operand 908 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:46,142 INFO L93 Difference]: Finished difference Result 1699 states and 2155 transitions. [2025-03-04 01:31:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:46,148 INFO L225 Difference]: With dead ends: 1699 [2025-03-04 01:31:46,148 INFO L226 Difference]: Without dead ends: 1204 [2025-03-04 01:31:46,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:46,149 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 69 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:46,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 540 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-03-04 01:31:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1018. [2025-03-04 01:31:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 945 states have (on average 1.2486772486772486) internal successors, (1180), 947 states have internal predecessors, (1180), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1288 transitions. [2025-03-04 01:31:46,211 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1288 transitions. Word has length 123 [2025-03-04 01:31:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1288 transitions. [2025-03-04 01:31:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1288 transitions. [2025-03-04 01:31:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:46,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:46,212 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:31:46,212 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1444244215, now seen corresponding path program 1 times [2025-03-04 01:31:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428100781] [2025-03-04 01:31:46,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:46,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:46,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:46,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:46,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428100781] [2025-03-04 01:31:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428100781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:46,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:31:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170161920] [2025-03-04 01:31:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:31:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:31:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:31:46,576 INFO L87 Difference]: Start difference. First operand 1018 states and 1288 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:46,948 INFO L93 Difference]: Finished difference Result 1949 states and 2462 transitions. [2025-03-04 01:31:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:31:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:46,952 INFO L225 Difference]: With dead ends: 1949 [2025-03-04 01:31:46,952 INFO L226 Difference]: Without dead ends: 1383 [2025-03-04 01:31:46,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:31:46,953 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 237 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:46,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1278 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:31:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-04 01:31:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1030. [2025-03-04 01:31:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 957 states have (on average 1.2455590386624869) internal successors, (1192), 959 states have internal predecessors, (1192), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1300 transitions. [2025-03-04 01:31:47,023 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1300 transitions. Word has length 123 [2025-03-04 01:31:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:47,023 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1300 transitions. [2025-03-04 01:31:47,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1300 transitions. [2025-03-04 01:31:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:47,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:47,024 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:31:47,025 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -984864651, now seen corresponding path program 1 times [2025-03-04 01:31:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274142135] [2025-03-04 01:31:47,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274142135] [2025-03-04 01:31:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274142135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813899921] [2025-03-04 01:31:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:47,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:47,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:47,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:47,477 INFO L87 Difference]: Start difference. First operand 1030 states and 1300 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:31:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:47,871 INFO L93 Difference]: Finished difference Result 1656 states and 2098 transitions. [2025-03-04 01:31:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:31:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 123 [2025-03-04 01:31:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:47,874 INFO L225 Difference]: With dead ends: 1656 [2025-03-04 01:31:47,874 INFO L226 Difference]: Without dead ends: 1130 [2025-03-04 01:31:47,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:31:47,875 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 154 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:47,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1045 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-04 01:31:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1034. [2025-03-04 01:31:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 961 states have (on average 1.2445369406867846) internal successors, (1196), 963 states have internal predecessors, (1196), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1304 transitions. [2025-03-04 01:31:47,951 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1304 transitions. Word has length 123 [2025-03-04 01:31:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:47,951 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1304 transitions. [2025-03-04 01:31:47,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:31:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1304 transitions. [2025-03-04 01:31:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:47,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:47,952 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:31:47,952 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 845469176, now seen corresponding path program 1 times [2025-03-04 01:31:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169749573] [2025-03-04 01:31:47,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:47,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:47,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:47,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:47,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169749573] [2025-03-04 01:31:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169749573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:31:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094531791] [2025-03-04 01:31:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:48,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:31:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:48,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:31:48,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:31:48,274 INFO L87 Difference]: Start difference. First operand 1034 states and 1304 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:48,618 INFO L93 Difference]: Finished difference Result 1899 states and 2384 transitions. [2025-03-04 01:31:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:31:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:48,622 INFO L225 Difference]: With dead ends: 1899 [2025-03-04 01:31:48,622 INFO L226 Difference]: Without dead ends: 1361 [2025-03-04 01:31:48,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:31:48,623 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 334 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:48,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 902 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-04 01:31:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1053. [2025-03-04 01:31:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 980 states have (on average 1.2510204081632652) internal successors, (1226), 982 states have internal predecessors, (1226), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1334 transitions. [2025-03-04 01:31:48,690 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1334 transitions. Word has length 123 [2025-03-04 01:31:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:48,690 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1334 transitions. [2025-03-04 01:31:48,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1334 transitions. [2025-03-04 01:31:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:48,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:48,691 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:48,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:31:48,691 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:48,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1941946311, now seen corresponding path program 1 times [2025-03-04 01:31:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865446756] [2025-03-04 01:31:48,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:48,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865446756] [2025-03-04 01:31:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865446756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:49,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368040100] [2025-03-04 01:31:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:49,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:49,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:49,078 INFO L87 Difference]: Start difference. First operand 1053 states and 1334 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:49,682 INFO L93 Difference]: Finished difference Result 1971 states and 2474 transitions. [2025-03-04 01:31:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:31:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 01:31:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:49,687 INFO L225 Difference]: With dead ends: 1971 [2025-03-04 01:31:49,687 INFO L226 Difference]: Without dead ends: 1412 [2025-03-04 01:31:49,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:31:49,688 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 370 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:49,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1375 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-03-04 01:31:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1053. [2025-03-04 01:31:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 980 states have (on average 1.2428571428571429) internal successors, (1218), 982 states have internal predecessors, (1218), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1326 transitions. [2025-03-04 01:31:49,752 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1326 transitions. Word has length 123 [2025-03-04 01:31:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:49,753 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1326 transitions. [2025-03-04 01:31:49,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1326 transitions. [2025-03-04 01:31:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:49,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:49,753 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:49,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:31:49,754 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:49,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash -588636614, now seen corresponding path program 1 times [2025-03-04 01:31:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262714755] [2025-03-04 01:31:49,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:49,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:49,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:49,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:49,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262714755] [2025-03-04 01:31:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262714755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:49,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326888050] [2025-03-04 01:31:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:49,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:49,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:49,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:49,991 INFO L87 Difference]: Start difference. First operand 1053 states and 1326 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:50,207 INFO L93 Difference]: Finished difference Result 1680 states and 2118 transitions. [2025-03-04 01:31:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:50,214 INFO L225 Difference]: With dead ends: 1680 [2025-03-04 01:31:50,214 INFO L226 Difference]: Without dead ends: 1146 [2025-03-04 01:31:50,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:31:50,217 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 77 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:50,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 787 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-04 01:31:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1043. [2025-03-04 01:31:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 969 states have (on average 1.240454076367389) internal successors, (1202), 971 states have internal predecessors, (1202), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1310 transitions. [2025-03-04 01:31:50,285 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1310 transitions. Word has length 123 [2025-03-04 01:31:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:50,286 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1310 transitions. [2025-03-04 01:31:50,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1310 transitions. [2025-03-04 01:31:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:50,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:50,286 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:31:50,287 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -992371335, now seen corresponding path program 1 times [2025-03-04 01:31:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172831139] [2025-03-04 01:31:50,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:50,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:50,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:50,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172831139] [2025-03-04 01:31:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172831139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:31:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881948207] [2025-03-04 01:31:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:31:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:50,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:31:50,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:50,499 INFO L87 Difference]: Start difference. First operand 1043 states and 1310 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:50,729 INFO L93 Difference]: Finished difference Result 1885 states and 2388 transitions. [2025-03-04 01:31:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:50,733 INFO L225 Difference]: With dead ends: 1885 [2025-03-04 01:31:50,734 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 01:31:50,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:50,735 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 194 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:50,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 498 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 01:31:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1055. [2025-03-04 01:31:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 981 states have (on average 1.2375127420998981) internal successors, (1214), 983 states have internal predecessors, (1214), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1322 transitions. [2025-03-04 01:31:50,805 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1322 transitions. Word has length 123 [2025-03-04 01:31:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:50,806 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1322 transitions. [2025-03-04 01:31:50,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1322 transitions. [2025-03-04 01:31:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:50,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:50,807 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:31:50,807 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:50,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash 873487095, now seen corresponding path program 1 times [2025-03-04 01:31:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670955892] [2025-03-04 01:31:50,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:50,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:50,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:50,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670955892] [2025-03-04 01:31:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670955892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:31:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485293122] [2025-03-04 01:31:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:31:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:50,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:31:50,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:31:50,987 INFO L87 Difference]: Start difference. First operand 1055 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:51,213 INFO L93 Difference]: Finished difference Result 1828 states and 2295 transitions. [2025-03-04 01:31:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:31:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:31:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:51,216 INFO L225 Difference]: With dead ends: 1828 [2025-03-04 01:31:51,217 INFO L226 Difference]: Without dead ends: 1234 [2025-03-04 01:31:51,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:51,218 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 83 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:51,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 497 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-03-04 01:31:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1043. [2025-03-04 01:31:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 969 states have (on average 1.2373581011351908) internal successors, (1199), 971 states have internal predecessors, (1199), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1307 transitions. [2025-03-04 01:31:51,285 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1307 transitions. Word has length 123 [2025-03-04 01:31:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:51,286 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1307 transitions. [2025-03-04 01:31:51,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1307 transitions. [2025-03-04 01:31:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:51,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:51,286 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:51,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:31:51,286 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -299269638, now seen corresponding path program 1 times [2025-03-04 01:31:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845127386] [2025-03-04 01:31:51,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:51,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:51,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845127386] [2025-03-04 01:31:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845127386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:31:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215719928] [2025-03-04 01:31:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:31:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:51,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:31:51,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:31:51,739 INFO L87 Difference]: Start difference. First operand 1043 states and 1307 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:52,481 INFO L93 Difference]: Finished difference Result 1879 states and 2343 transitions. [2025-03-04 01:31:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:31:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 01:31:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:52,487 INFO L225 Difference]: With dead ends: 1879 [2025-03-04 01:31:52,487 INFO L226 Difference]: Without dead ends: 1257 [2025-03-04 01:31:52,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:31:52,489 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 440 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:52,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1394 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:31:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-04 01:31:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1005. [2025-03-04 01:31:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 930 states have (on average 1.232258064516129) internal successors, (1146), 932 states have internal predecessors, (1146), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1254 transitions. [2025-03-04 01:31:52,564 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1254 transitions. Word has length 123 [2025-03-04 01:31:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1254 transitions. [2025-03-04 01:31:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1254 transitions. [2025-03-04 01:31:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:31:52,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:52,564 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:31:52,565 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:52,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1566588792, now seen corresponding path program 1 times [2025-03-04 01:31:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284602464] [2025-03-04 01:31:52,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:52,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:31:52,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:31:52,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:52,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284602464] [2025-03-04 01:31:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284602464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:31:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606388120] [2025-03-04 01:31:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:31:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:31:53,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:31:53,056 INFO L87 Difference]: Start difference. First operand 1005 states and 1254 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:53,814 INFO L93 Difference]: Finished difference Result 1811 states and 2250 transitions. [2025-03-04 01:31:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:31:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 01:31:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:53,817 INFO L225 Difference]: With dead ends: 1811 [2025-03-04 01:31:53,817 INFO L226 Difference]: Without dead ends: 1272 [2025-03-04 01:31:53,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:31:53,819 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 423 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:53,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1254 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:31:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2025-03-04 01:31:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1007. [2025-03-04 01:31:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 932 states have (on average 1.2274678111587982) internal successors, (1144), 934 states have internal predecessors, (1144), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1252 transitions. [2025-03-04 01:31:53,890 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1252 transitions. Word has length 123 [2025-03-04 01:31:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1252 transitions. [2025-03-04 01:31:53,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1252 transitions. [2025-03-04 01:31:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:31:53,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:53,891 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 01:31:53,891 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2093001554, now seen corresponding path program 1 times [2025-03-04 01:31:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27177914] [2025-03-04 01:31:53,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:53,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:31:53,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:31:53,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:53,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27177914] [2025-03-04 01:31:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27177914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:31:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816799772] [2025-03-04 01:31:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:31:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:54,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:31:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:54,197 INFO L87 Difference]: Start difference. First operand 1007 states and 1252 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:54,508 INFO L93 Difference]: Finished difference Result 1727 states and 2165 transitions. [2025-03-04 01:31:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:31:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:31:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:54,512 INFO L225 Difference]: With dead ends: 1727 [2025-03-04 01:31:54,512 INFO L226 Difference]: Without dead ends: 1205 [2025-03-04 01:31:54,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:31:54,513 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:54,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1146 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-04 01:31:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1085. [2025-03-04 01:31:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1010 states have (on average 1.2376237623762376) internal successors, (1250), 1012 states have internal predecessors, (1250), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1358 transitions. [2025-03-04 01:31:54,584 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1358 transitions. Word has length 125 [2025-03-04 01:31:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:54,584 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1358 transitions. [2025-03-04 01:31:54,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1358 transitions. [2025-03-04 01:31:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:31:54,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:54,585 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:54,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 01:31:54,585 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -694413933, now seen corresponding path program 1 times [2025-03-04 01:31:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705674580] [2025-03-04 01:31:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:54,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:31:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:31:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705674580] [2025-03-04 01:31:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705674580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:31:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600160720] [2025-03-04 01:31:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:31:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:54,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:31:54,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:31:54,755 INFO L87 Difference]: Start difference. First operand 1085 states and 1358 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:54,932 INFO L93 Difference]: Finished difference Result 1860 states and 2337 transitions. [2025-03-04 01:31:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:31:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:31:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:54,936 INFO L225 Difference]: With dead ends: 1860 [2025-03-04 01:31:54,936 INFO L226 Difference]: Without dead ends: 1283 [2025-03-04 01:31:54,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:31:54,937 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 64 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:54,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 626 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-04 01:31:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1091. [2025-03-04 01:31:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1016 states have (on average 1.234251968503937) internal successors, (1254), 1018 states have internal predecessors, (1254), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1362 transitions. [2025-03-04 01:31:55,013 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1362 transitions. Word has length 125 [2025-03-04 01:31:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:55,013 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1362 transitions. [2025-03-04 01:31:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1362 transitions. [2025-03-04 01:31:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:31:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:55,013 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:55,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 01:31:55,014 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1245381797, now seen corresponding path program 1 times [2025-03-04 01:31:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193794532] [2025-03-04 01:31:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:55,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:31:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:31:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193794532] [2025-03-04 01:31:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193794532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:31:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141748206] [2025-03-04 01:31:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:31:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:55,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:31:55,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:31:55,257 INFO L87 Difference]: Start difference. First operand 1091 states and 1362 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:55,517 INFO L93 Difference]: Finished difference Result 1789 states and 2217 transitions. [2025-03-04 01:31:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:31:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-03-04 01:31:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:55,520 INFO L225 Difference]: With dead ends: 1789 [2025-03-04 01:31:55,521 INFO L226 Difference]: Without dead ends: 1042 [2025-03-04 01:31:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:31:55,522 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 276 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 664 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-04 01:31:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 990. [2025-03-04 01:31:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 914 states have (on average 1.188183807439825) internal successors, (1086), 916 states have internal predecessors, (1086), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1194 transitions. [2025-03-04 01:31:55,601 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1194 transitions. Word has length 125 [2025-03-04 01:31:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:55,601 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1194 transitions. [2025-03-04 01:31:55,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:31:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1194 transitions. [2025-03-04 01:31:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:31:55,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:55,602 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:55,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 01:31:55,602 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:55,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1312388550, now seen corresponding path program 1 times [2025-03-04 01:31:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941202136] [2025-03-04 01:31:55,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:55,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:31:55,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:31:55,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941202136] [2025-03-04 01:31:56,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941202136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:56,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:56,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-04 01:31:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767251500] [2025-03-04 01:31:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:31:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:56,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:31:56,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:31:56,675 INFO L87 Difference]: Start difference. First operand 990 states and 1194 transitions. Second operand has 22 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 01:31:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:58,027 INFO L93 Difference]: Finished difference Result 1721 states and 2077 transitions. [2025-03-04 01:31:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:31:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 125 [2025-03-04 01:31:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:58,030 INFO L225 Difference]: With dead ends: 1721 [2025-03-04 01:31:58,030 INFO L226 Difference]: Without dead ends: 1196 [2025-03-04 01:31:58,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1172, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:31:58,031 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 377 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:58,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1798 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:31:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-03-04 01:31:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 990. [2025-03-04 01:31:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 914 states have (on average 1.1859956236323852) internal successors, (1084), 916 states have internal predecessors, (1084), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:31:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1192 transitions. [2025-03-04 01:31:58,111 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1192 transitions. Word has length 125 [2025-03-04 01:31:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:58,111 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1192 transitions. [2025-03-04 01:31:58,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 01:31:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1192 transitions. [2025-03-04 01:31:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:31:58,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:58,112 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:58,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 01:31:58,113 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:58,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2091323925, now seen corresponding path program 1 times [2025-03-04 01:31:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084653901] [2025-03-04 01:31:58,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:31:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:31:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084653901] [2025-03-04 01:31:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084653901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:58,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:31:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469256415] [2025-03-04 01:31:58,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:31:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:58,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:31:58,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:31:58,324 INFO L87 Difference]: Start difference. First operand 990 states and 1192 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:58,612 INFO L93 Difference]: Finished difference Result 1626 states and 1965 transitions. [2025-03-04 01:31:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:31:58,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-04 01:31:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:58,615 INFO L225 Difference]: With dead ends: 1626 [2025-03-04 01:31:58,615 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 01:31:58,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:31:58,616 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 251 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:58,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 595 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:31:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 01:31:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 981. [2025-03-04 01:31:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 896 states have (on average 1.1796875) internal successors, (1057), 899 states have internal predecessors, (1057), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:31:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1177 transitions. [2025-03-04 01:31:58,707 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1177 transitions. Word has length 127 [2025-03-04 01:31:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1177 transitions. [2025-03-04 01:31:58,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:31:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1177 transitions. [2025-03-04 01:31:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:31:58,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:58,708 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 01:31:58,708 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:58,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1912268264, now seen corresponding path program 1 times [2025-03-04 01:31:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007615442] [2025-03-04 01:31:58,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:58,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:31:58,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:31:58,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:58,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:31:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:31:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:31:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007615442] [2025-03-04 01:31:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007615442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:31:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:31:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:31:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77227705] [2025-03-04 01:31:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:31:59,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:31:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:31:59,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:31:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:31:59,048 INFO L87 Difference]: Start difference. First operand 981 states and 1177 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:31:59,446 INFO L93 Difference]: Finished difference Result 1631 states and 1964 transitions. [2025-03-04 01:31:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:31:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:31:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:31:59,449 INFO L225 Difference]: With dead ends: 1631 [2025-03-04 01:31:59,449 INFO L226 Difference]: Without dead ends: 1094 [2025-03-04 01:31:59,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:31:59,450 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 92 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:31:59,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1887 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:31:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-03-04 01:31:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 970. [2025-03-04 01:31:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 885 states have (on average 1.1796610169491526) internal successors, (1044), 888 states have internal predecessors, (1044), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:31:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1164 transitions. [2025-03-04 01:31:59,544 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1164 transitions. Word has length 127 [2025-03-04 01:31:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:31:59,545 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1164 transitions. [2025-03-04 01:31:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:31:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1164 transitions. [2025-03-04 01:31:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 01:31:59,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:31:59,546 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:31:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 01:31:59,547 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:31:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:31:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1819984493, now seen corresponding path program 1 times [2025-03-04 01:31:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:31:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107475445] [2025-03-04 01:31:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:31:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:31:59,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:31:59,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:31:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:31:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2025-03-04 01:32:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107475445] [2025-03-04 01:32:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107475445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359957629] [2025-03-04 01:32:00,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:00,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:32:00,187 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-04 01:32:00,188 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-04 01:32:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:32:00,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:32:00,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:00,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:00,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:32:00,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:32:00,474 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 20 treesize of output 12 [2025-03-04 01:32:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:00,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:32:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359957629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:32:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-04 01:32:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49438240] [2025-03-04 01:32:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:32:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:00,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:32:00,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:32:00,488 INFO L87 Difference]: Start difference. First operand 970 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:00,612 INFO L93 Difference]: Finished difference Result 1474 states and 1779 transitions. [2025-03-04 01:32:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:32:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 232 [2025-03-04 01:32:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:00,615 INFO L225 Difference]: With dead ends: 1474 [2025-03-04 01:32:00,615 INFO L226 Difference]: Without dead ends: 937 [2025-03-04 01:32:00,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:32:00,616 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:00,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 481 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-04 01:32:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 932. [2025-03-04 01:32:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 847 states have (on average 1.1700118063754428) internal successors, (991), 850 states have internal predecessors, (991), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1111 transitions. [2025-03-04 01:32:00,717 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1111 transitions. Word has length 232 [2025-03-04 01:32:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:00,717 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1111 transitions. [2025-03-04 01:32:00,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1111 transitions. [2025-03-04 01:32:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 01:32:00,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:00,719 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-04 01:32:00,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:32:00,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:00,920 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:00,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 867845135, now seen corresponding path program 1 times [2025-03-04 01:32:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:00,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802456881] [2025-03-04 01:32:00,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:00,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:32:01,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:32:01,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:01,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-04 01:32:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802456881] [2025-03-04 01:32:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802456881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951319301] [2025-03-04 01:32:01,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:01,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:32:01,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:32:01,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:32:01,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:32:02,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:32:02,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:32:02,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:32:02,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:32:02,424 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 15 treesize of output 11 [2025-03-04 01:32:02,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:32:02,509 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 36 treesize of output 24 [2025-03-04 01:32:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 124 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2025-03-04 01:32:02,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:32:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:02,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951319301] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:02,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:32:02,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 8] total 22 [2025-03-04 01:32:02,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3376826] [2025-03-04 01:32:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:32:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:02,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:32:02,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:32:02,687 INFO L87 Difference]: Start difference. First operand 932 states and 1111 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:02,947 INFO L93 Difference]: Finished difference Result 1617 states and 1952 transitions. [2025-03-04 01:32:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:32:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 232 [2025-03-04 01:32:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:02,951 INFO L225 Difference]: With dead ends: 1617 [2025-03-04 01:32:02,951 INFO L226 Difference]: Without dead ends: 1115 [2025-03-04 01:32:02,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 454 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:32:02,952 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 164 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:02,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 630 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:32:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-04 01:32:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 940. [2025-03-04 01:32:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 855 states have (on average 1.1730994152046783) internal successors, (1003), 858 states have internal predecessors, (1003), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1123 transitions. [2025-03-04 01:32:03,078 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1123 transitions. Word has length 232 [2025-03-04 01:32:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:03,078 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1123 transitions. [2025-03-04 01:32:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1123 transitions. [2025-03-04 01:32:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 01:32:03,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:03,079 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 01:32:03,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:32:03,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:03,280 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:03,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1919570352, now seen corresponding path program 1 times [2025-03-04 01:32:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651086553] [2025-03-04 01:32:03,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:32:03,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:32:03,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-04 01:32:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651086553] [2025-03-04 01:32:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651086553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049428573] [2025-03-04 01:32:03,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:03,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:32:03,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:32:03,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:32:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 01:32:03,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 01:32:03,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:03,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:03,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:32:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:32:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:32:04,338 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 15 treesize of output 11 [2025-03-04 01:32:04,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:32:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 13 proven. 224 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-03-04 01:32:04,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:32:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049428573] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:32:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 13 [2025-03-04 01:32:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808487435] [2025-03-04 01:32:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:32:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:04,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:32:04,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:32:04,481 INFO L87 Difference]: Start difference. First operand 940 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:04,613 INFO L93 Difference]: Finished difference Result 1444 states and 1727 transitions. [2025-03-04 01:32:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:32:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 232 [2025-03-04 01:32:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:04,616 INFO L225 Difference]: With dead ends: 1444 [2025-03-04 01:32:04,616 INFO L226 Difference]: Without dead ends: 926 [2025-03-04 01:32:04,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:32:04,617 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 59 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 509 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-04 01:32:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 879. [2025-03-04 01:32:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 794 states have (on average 1.149874055415617) internal successors, (913), 797 states have internal predecessors, (913), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1033 transitions. [2025-03-04 01:32:04,709 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1033 transitions. Word has length 232 [2025-03-04 01:32:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1033 transitions. [2025-03-04 01:32:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1033 transitions. [2025-03-04 01:32:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 01:32:04,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:04,710 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:04,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:32:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:04,911 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1254589226, now seen corresponding path program 1 times [2025-03-04 01:32:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192532307] [2025-03-04 01:32:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:04,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 01:32:04,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 01:32:04,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:04,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192532307] [2025-03-04 01:32:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192532307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:32:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321511438] [2025-03-04 01:32:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:05,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:32:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:05,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:32:05,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:32:05,289 INFO L87 Difference]: Start difference. First operand 879 states and 1033 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:05,680 INFO L93 Difference]: Finished difference Result 2034 states and 2379 transitions. [2025-03-04 01:32:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:32:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-03-04 01:32:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:05,684 INFO L225 Difference]: With dead ends: 2034 [2025-03-04 01:32:05,684 INFO L226 Difference]: Without dead ends: 1350 [2025-03-04 01:32:05,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:32:05,685 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 264 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:05,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 659 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:32:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-04 01:32:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 921. [2025-03-04 01:32:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 836 states have (on average 1.1483253588516746) internal successors, (960), 839 states have internal predecessors, (960), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1080 transitions. [2025-03-04 01:32:05,782 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1080 transitions. Word has length 233 [2025-03-04 01:32:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:05,783 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1080 transitions. [2025-03-04 01:32:05,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1080 transitions. [2025-03-04 01:32:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 01:32:05,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:05,784 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:05,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 01:32:05,784 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1337770, now seen corresponding path program 1 times [2025-03-04 01:32:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460510485] [2025-03-04 01:32:05,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 01:32:05,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 01:32:05,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:05,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460510485] [2025-03-04 01:32:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460510485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:32:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203866495] [2025-03-04 01:32:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:06,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:32:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:06,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:32:06,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:32:06,133 INFO L87 Difference]: Start difference. First operand 921 states and 1080 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:06,316 INFO L93 Difference]: Finished difference Result 1742 states and 2039 transitions. [2025-03-04 01:32:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:32:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-03-04 01:32:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:06,319 INFO L225 Difference]: With dead ends: 1742 [2025-03-04 01:32:06,319 INFO L226 Difference]: Without dead ends: 987 [2025-03-04 01:32:06,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:32:06,319 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 160 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:06,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 433 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:32:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-04 01:32:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 921. [2025-03-04 01:32:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 836 states have (on average 1.1435406698564594) internal successors, (956), 839 states have internal predecessors, (956), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1076 transitions. [2025-03-04 01:32:06,414 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1076 transitions. Word has length 233 [2025-03-04 01:32:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:06,414 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1076 transitions. [2025-03-04 01:32:06,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1076 transitions. [2025-03-04 01:32:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 01:32:06,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:06,416 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:06,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 01:32:06,416 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:06,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1795613589, now seen corresponding path program 1 times [2025-03-04 01:32:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265229411] [2025-03-04 01:32:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:06,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 01:32:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 01:32:06,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-04 01:32:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265229411] [2025-03-04 01:32:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265229411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:32:06,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257778700] [2025-03-04 01:32:06,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:06,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:32:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:06,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:32:06,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:32:06,800 INFO L87 Difference]: Start difference. First operand 921 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:07,016 INFO L93 Difference]: Finished difference Result 1935 states and 2266 transitions. [2025-03-04 01:32:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:32:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-03-04 01:32:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:07,019 INFO L225 Difference]: With dead ends: 1935 [2025-03-04 01:32:07,019 INFO L226 Difference]: Without dead ends: 1180 [2025-03-04 01:32:07,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-04 01:32:07,020 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 87 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:07,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1049 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:32:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-04 01:32:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 921. [2025-03-04 01:32:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 836 states have (on average 1.1435406698564594) internal successors, (956), 839 states have internal predecessors, (956), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1076 transitions. [2025-03-04 01:32:07,119 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1076 transitions. Word has length 233 [2025-03-04 01:32:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1076 transitions. [2025-03-04 01:32:07,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1076 transitions. [2025-03-04 01:32:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 01:32:07,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:07,121 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:07,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 01:32:07,121 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:07,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 130420489, now seen corresponding path program 1 times [2025-03-04 01:32:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740680491] [2025-03-04 01:32:07,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 01:32:07,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 01:32:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:07,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740680491] [2025-03-04 01:32:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740680491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:07,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:07,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:32:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519143706] [2025-03-04 01:32:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:07,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:32:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:07,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:32:07,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:32:07,331 INFO L87 Difference]: Start difference. First operand 921 states and 1076 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:07,493 INFO L93 Difference]: Finished difference Result 1729 states and 2017 transitions. [2025-03-04 01:32:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:32:07,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-03-04 01:32:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:07,496 INFO L225 Difference]: With dead ends: 1729 [2025-03-04 01:32:07,496 INFO L226 Difference]: Without dead ends: 974 [2025-03-04 01:32:07,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:07,498 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 42 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:07,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 465 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-04 01:32:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 928. [2025-03-04 01:32:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 843 states have (on average 1.1340450771055752) internal successors, (956), 846 states have internal predecessors, (956), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1076 transitions. [2025-03-04 01:32:07,598 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1076 transitions. Word has length 233 [2025-03-04 01:32:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1076 transitions. [2025-03-04 01:32:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1076 transitions. [2025-03-04 01:32:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 01:32:07,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:07,600 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 01:32:07,600 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1187582473, now seen corresponding path program 1 times [2025-03-04 01:32:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343783840] [2025-03-04 01:32:07,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 01:32:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 01:32:07,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343783840] [2025-03-04 01:32:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343783840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:07,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:32:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082769259] [2025-03-04 01:32:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:07,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:32:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:07,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:32:07,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:32:07,786 INFO L87 Difference]: Start difference. First operand 928 states and 1076 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:07,916 INFO L93 Difference]: Finished difference Result 1664 states and 1927 transitions. [2025-03-04 01:32:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:32:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-03-04 01:32:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:07,919 INFO L225 Difference]: With dead ends: 1664 [2025-03-04 01:32:07,919 INFO L226 Difference]: Without dead ends: 906 [2025-03-04 01:32:07,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:07,920 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 468 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-04 01:32:07,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 468 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-04 01:32:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 872. [2025-03-04 01:32:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 787 states have (on average 1.130876747141042) internal successors, (890), 790 states have internal predecessors, (890), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1010 transitions. [2025-03-04 01:32:08,025 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1010 transitions. Word has length 233 [2025-03-04 01:32:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:08,025 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1010 transitions. [2025-03-04 01:32:08,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1010 transitions. [2025-03-04 01:32:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-04 01:32:08,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:08,027 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-04 01:32:08,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-04 01:32:08,027 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:08,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1702181328, now seen corresponding path program 1 times [2025-03-04 01:32:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:08,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762231986] [2025-03-04 01:32:08,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:08,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 01:32:08,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 01:32:08,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:08,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-04 01:32:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762231986] [2025-03-04 01:32:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762231986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:32:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913585673] [2025-03-04 01:32:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:08,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:32:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:08,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:32:08,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:08,315 INFO L87 Difference]: Start difference. First operand 872 states and 1010 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:08,462 INFO L93 Difference]: Finished difference Result 1472 states and 1702 transitions. [2025-03-04 01:32:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:32:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 234 [2025-03-04 01:32:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:08,465 INFO L225 Difference]: With dead ends: 1472 [2025-03-04 01:32:08,465 INFO L226 Difference]: Without dead ends: 947 [2025-03-04 01:32:08,466 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-04 01:32:08,466 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 82 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:08,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 469 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-04 01:32:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 874. [2025-03-04 01:32:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 789 states have (on average 1.129277566539924) internal successors, (891), 792 states have internal predecessors, (891), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1011 transitions. [2025-03-04 01:32:08,563 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1011 transitions. Word has length 234 [2025-03-04 01:32:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:08,563 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1011 transitions. [2025-03-04 01:32:08,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1011 transitions. [2025-03-04 01:32:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-04 01:32:08,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:08,564 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-04 01:32:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-04 01:32:08,565 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1535623984, now seen corresponding path program 1 times [2025-03-04 01:32:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740460728] [2025-03-04 01:32:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:08,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 01:32:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 01:32:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-04 01:32:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740460728] [2025-03-04 01:32:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740460728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:32:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753330382] [2025-03-04 01:32:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:08,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:32:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:08,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:32:08,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:08,856 INFO L87 Difference]: Start difference. First operand 874 states and 1011 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:09,031 INFO L93 Difference]: Finished difference Result 1499 states and 1733 transitions. [2025-03-04 01:32:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:32:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 234 [2025-03-04 01:32:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:09,034 INFO L225 Difference]: With dead ends: 1499 [2025-03-04 01:32:09,034 INFO L226 Difference]: Without dead ends: 976 [2025-03-04 01:32:09,035 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-04 01:32:09,035 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 54 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:09,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 662 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-04 01:32:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871. [2025-03-04 01:32:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 786 states have (on average 1.1157760814249365) internal successors, (877), 789 states have internal predecessors, (877), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 997 transitions. [2025-03-04 01:32:09,131 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 997 transitions. Word has length 234 [2025-03-04 01:32:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:09,131 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 997 transitions. [2025-03-04 01:32:09,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 997 transitions. [2025-03-04 01:32:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 01:32:09,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:09,133 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:32:09,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-04 01:32:09,133 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 861808334, now seen corresponding path program 1 times [2025-03-04 01:32:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989720815] [2025-03-04 01:32:09,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:09,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 01:32:09,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 01:32:09,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:09,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-04 01:32:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989720815] [2025-03-04 01:32:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989720815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:09,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:32:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212223657] [2025-03-04 01:32:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:32:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:09,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:32:09,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:09,502 INFO L87 Difference]: Start difference. First operand 871 states and 997 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:09,718 INFO L93 Difference]: Finished difference Result 1466 states and 1672 transitions. [2025-03-04 01:32:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:32:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-03-04 01:32:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:09,721 INFO L225 Difference]: With dead ends: 1466 [2025-03-04 01:32:09,721 INFO L226 Difference]: Without dead ends: 952 [2025-03-04 01:32:09,722 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-04 01:32:09,722 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 83 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 567 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:32:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-04 01:32:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 738. [2025-03-04 01:32:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 653 states have (on average 1.104134762633997) internal successors, (721), 656 states have internal predecessors, (721), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 841 transitions. [2025-03-04 01:32:09,820 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 841 transitions. Word has length 236 [2025-03-04 01:32:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:09,820 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 841 transitions. [2025-03-04 01:32:09,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 841 transitions. [2025-03-04 01:32:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 01:32:09,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:09,821 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-04 01:32:09,821 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:09,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash -515241248, now seen corresponding path program 1 times [2025-03-04 01:32:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128885397] [2025-03-04 01:32:09,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:09,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:32:09,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:32:09,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:09,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-04 01:32:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128885397] [2025-03-04 01:32:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128885397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:10,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:32:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762497127] [2025-03-04 01:32:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:32:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:10,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:32:10,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:32:10,245 INFO L87 Difference]: Start difference. First operand 738 states and 841 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:10,574 INFO L93 Difference]: Finished difference Result 1313 states and 1485 transitions. [2025-03-04 01:32:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:32:10,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2025-03-04 01:32:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:10,576 INFO L225 Difference]: With dead ends: 1313 [2025-03-04 01:32:10,576 INFO L226 Difference]: Without dead ends: 819 [2025-03-04 01:32:10,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:32:10,577 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 173 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:10,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 693 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:32:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-04 01:32:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 684. [2025-03-04 01:32:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 599 states have (on average 1.0884808013355594) internal successors, (652), 602 states have internal predecessors, (652), 60 states have call successors, (60), 24 states have call predecessors, (60), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:32:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 772 transitions. [2025-03-04 01:32:10,675 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 772 transitions. Word has length 237 [2025-03-04 01:32:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:10,675 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 772 transitions. [2025-03-04 01:32:10,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 772 transitions. [2025-03-04 01:32:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 01:32:10,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:10,678 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:10,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-04 01:32:10,678 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1659980062, now seen corresponding path program 1 times [2025-03-04 01:32:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219978172] [2025-03-04 01:32:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:32:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:32:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-04 01:32:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219978172] [2025-03-04 01:32:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219978172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:32:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870644548] [2025-03-04 01:32:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:11,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:32:11,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:32:11,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:32:11,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:32:11,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:32:11,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:11,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:11,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:32:11,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:32:12,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:32:12,172 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 17 treesize of output 9 [2025-03-04 01:32:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 29 proven. 832 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-03-04 01:32:12,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:32:12,358 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 32 treesize of output 28 [2025-03-04 01:32:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 66 proven. 64 refuted. 0 times theorem prover too weak. 1437 trivial. 0 not checked. [2025-03-04 01:32:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870644548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:32:12,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:32:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 26 [2025-03-04 01:32:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150271847] [2025-03-04 01:32:12,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:32:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 01:32:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:12,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 01:32:12,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:32:12,528 INFO L87 Difference]: Start difference. First operand 684 states and 772 transitions. Second operand has 26 states, 22 states have (on average 9.5) internal successors, (209), 25 states have internal predecessors, (209), 11 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 8 states have call predecessors, (72), 11 states have call successors, (72) [2025-03-04 01:32:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:13,774 INFO L93 Difference]: Finished difference Result 1149 states and 1282 transitions. [2025-03-04 01:32:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 01:32:13,774 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 9.5) internal successors, (209), 25 states have internal predecessors, (209), 11 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 8 states have call predecessors, (72), 11 states have call successors, (72) Word has length 237 [2025-03-04 01:32:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:13,776 INFO L225 Difference]: With dead ends: 1149 [2025-03-04 01:32:13,776 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 01:32:13,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=2349, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 01:32:13,778 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 375 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1486 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:32:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 01:32:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 522. [2025-03-04 01:32:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 447 states have (on average 1.0693512304250559) internal successors, (478), 448 states have internal predecessors, (478), 50 states have call successors, (50), 24 states have call predecessors, (50), 24 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:32:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 578 transitions. [2025-03-04 01:32:13,877 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 578 transitions. Word has length 237 [2025-03-04 01:32:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:13,877 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 578 transitions. [2025-03-04 01:32:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 9.5) internal successors, (209), 25 states have internal predecessors, (209), 11 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 8 states have call predecessors, (72), 11 states have call successors, (72) [2025-03-04 01:32:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 578 transitions. [2025-03-04 01:32:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-04 01:32:13,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:32:13,879 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:13,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:32:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:32:14,079 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:32:14,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:32:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -733990309, now seen corresponding path program 1 times [2025-03-04 01:32:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:32:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52607555] [2025-03-04 01:32:14,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:32:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:32:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-04 01:32:14,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-04 01:32:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:32:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:32:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2025-03-04 01:32:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:32:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52607555] [2025-03-04 01:32:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52607555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:32:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:32:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:32:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337361956] [2025-03-04 01:32:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:32:14,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:32:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:32:14,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:32:14,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:32:14,448 INFO L87 Difference]: Start difference. First operand 522 states and 578 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:32:14,678 INFO L93 Difference]: Finished difference Result 862 states and 950 transitions. [2025-03-04 01:32:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:32:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 246 [2025-03-04 01:32:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:32:14,679 INFO L225 Difference]: With dead ends: 862 [2025-03-04 01:32:14,679 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:32:14,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:32:14,680 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:32:14,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 546 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:32:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:32:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:32:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:32:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:32:14,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2025-03-04 01:32:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:32:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:32:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:32:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:32:14,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:32:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:32:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-04 01:32:14,685 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:32:14,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.