./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.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 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:44:55,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:44:55,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:44:56,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:44:56,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:44:56,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:44:56,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:44:56,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:44:56,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:44:56,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:44:56,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:44:56,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:44:56,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:44:56,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:44:56,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:44:56,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:44:56,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:44:56,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:44:56,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:44:56,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:44:56,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:44:56,031 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 -> 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e [2025-03-17 05:44:56,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:44:56,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:44:56,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:44:56,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:44:56,322 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:44:56,324 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-32.i [2025-03-17 05:44:57,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b2b9a19/4a22052e64bc49d293327e4781ec679d/FLAG0400136c4 [2025-03-17 05:44:57,788 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:44:57,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2025-03-17 05:44:57,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b2b9a19/4a22052e64bc49d293327e4781ec679d/FLAG0400136c4 [2025-03-17 05:44:58,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b2b9a19/4a22052e64bc49d293327e4781ec679d [2025-03-17 05:44:58,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:44:58,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:44:58,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:44:58,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:44:58,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:44:58,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce8d7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58, skipping insertion in model container [2025-03-17 05:44:58,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:44:58,228 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-32.i[916,929] [2025-03-17 05:44:58,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:44:58,290 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:44:58,298 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-32.i[916,929] [2025-03-17 05:44:58,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:44:58,346 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:44:58,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58 WrapperNode [2025-03-17 05:44:58,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:44:58,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:44:58,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:44:58,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:44:58,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,397 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2025-03-17 05:44:58,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:44:58,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:44:58,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:44:58,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:44:58,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,441 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 7, 18, 20, 8, 8, 12, 12, 8, 6, 7, 10, 6]. 16 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 15 writes are split as follows [0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1]. [2025-03-17 05:44:58,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:44:58,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:44:58,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:44:58,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:44:58,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (1/1) ... [2025-03-17 05:44:58,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:44:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:58,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:44:58,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:44:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:44:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:44:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:44:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:44:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:44:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:44:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:44:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:44:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:44:58,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:44:58,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:44:59,051 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-17 05:44:59,091 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-17 05:44:59,091 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:44:59,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:44:59,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:44:59,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:44:59 BoogieIcfgContainer [2025-03-17 05:44:59,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:44:59,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:44:59,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:44:59,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:44:59,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:44:58" (1/3) ... [2025-03-17 05:44:59,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef65a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:44:59, skipping insertion in model container [2025-03-17 05:44:59,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:58" (2/3) ... [2025-03-17 05:44:59,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef65a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:44:59, skipping insertion in model container [2025-03-17 05:44:59,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:44:59" (3/3) ... [2025-03-17 05:44:59,109 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-32.i [2025-03-17 05:44:59,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:44:59,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-32.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:44:59,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:44:59,180 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;@768e429, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:44:59,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:44:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:44:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:44:59,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:59,196 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:59,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:59,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1408858977, now seen corresponding path program 1 times [2025-03-17 05:44:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166412789] [2025-03-17 05:44:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:44:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:44:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:44:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166412789] [2025-03-17 05:44:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166412789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381170583] [2025-03-17 05:44:59,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:59,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:59,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:59,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:44:59,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:44:59,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:44:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:59,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:44:59,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:44:59,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381170583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:59,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:44:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420931571] [2025-03-17 05:44:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:44:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:59,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:44:59,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:44:59,743 INFO L87 Difference]: Start difference. First operand has 93 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:44:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:59,782 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2025-03-17 05:44:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:44:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2025-03-17 05:44:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:59,788 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:44:59,788 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 05:44:59,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:44:59,792 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:59,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 05:44:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 05:44:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:44:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-03-17 05:44:59,828 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 125 [2025-03-17 05:44:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-03-17 05:44:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:44:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-03-17 05:44:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:44:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:59,833 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:59,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:00,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:45:00,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1287258767, now seen corresponding path program 1 times [2025-03-17 05:45:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-17 05:45:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:00,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:00,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:00,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:00,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-17 05:45:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162852570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:00,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:45:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060581660] [2025-03-17 05:45:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:45:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:00,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:45:00,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:00,359 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:00,517 INFO L93 Difference]: Finished difference Result 310 states and 436 transitions. [2025-03-17 05:45:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:45:00,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2025-03-17 05:45:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:00,523 INFO L225 Difference]: With dead ends: 310 [2025-03-17 05:45:00,523 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:45:00,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:00,524 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 209 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:00,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 360 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:45:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 187. [2025-03-17 05:45:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 148 states have internal predecessors, (192), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:45:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 264 transitions. [2025-03-17 05:45:00,550 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 264 transitions. Word has length 125 [2025-03-17 05:45:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 264 transitions. [2025-03-17 05:45:00,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 264 transitions. [2025-03-17 05:45:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:45:00,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:00,554 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:00,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:45:00,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:00,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1372829727, now seen corresponding path program 1 times [2025-03-17 05:45:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073140158] [2025-03-17 05:45:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:00,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:45:00,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:45:00,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073140158] [2025-03-17 05:45:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073140158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:01,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:45:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557719290] [2025-03-17 05:45:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:01,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:45:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:01,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:45:01,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:45:01,459 INFO L87 Difference]: Start difference. First operand 187 states and 264 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:01,713 INFO L93 Difference]: Finished difference Result 499 states and 702 transitions. [2025-03-17 05:45:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:45:01,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-17 05:45:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:01,718 INFO L225 Difference]: With dead ends: 499 [2025-03-17 05:45:01,718 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 05:45:01,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:45:01,721 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 77 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:01,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1122 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 05:45:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2025-03-17 05:45:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 260 states have (on average 1.3269230769230769) internal successors, (345), 262 states have internal predecessors, (345), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2025-03-17 05:45:01,752 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 133 [2025-03-17 05:45:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:01,752 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2025-03-17 05:45:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2025-03-17 05:45:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:45:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:01,754 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:45:01,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2056417380, now seen corresponding path program 1 times [2025-03-17 05:45:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502093872] [2025-03-17 05:45:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:01,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:45:01,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:45:01,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:01,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502093872] [2025-03-17 05:45:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502093872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:45:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361827112] [2025-03-17 05:45:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:45:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:45:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:45:02,819 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:03,782 INFO L93 Difference]: Finished difference Result 659 states and 917 transitions. [2025-03-17 05:45:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:45:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2025-03-17 05:45:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:03,787 INFO L225 Difference]: With dead ends: 659 [2025-03-17 05:45:03,788 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 05:45:03,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:45:03,790 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 401 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:03,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1069 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:45:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 05:45:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 309. [2025-03-17 05:45:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 260 states have (on average 1.323076923076923) internal successors, (344), 262 states have internal predecessors, (344), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 432 transitions. [2025-03-17 05:45:03,813 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 432 transitions. Word has length 135 [2025-03-17 05:45:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 432 transitions. [2025-03-17 05:45:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 432 transitions. [2025-03-17 05:45:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:45:03,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:03,814 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:03,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:45:03,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:03,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash 271940420, now seen corresponding path program 1 times [2025-03-17 05:45:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:03,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659643009] [2025-03-17 05:45:03,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:45:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:45:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659643009] [2025-03-17 05:45:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659643009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:05,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:05,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-17 05:45:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632622144] [2025-03-17 05:45:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:05,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:45:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:05,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:45:05,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:45:05,313 INFO L87 Difference]: Start difference. First operand 309 states and 432 transitions. Second operand has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-17 05:45:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:06,714 INFO L93 Difference]: Finished difference Result 695 states and 962 transitions. [2025-03-17 05:45:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:45:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) Word has length 135 [2025-03-17 05:45:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:06,717 INFO L225 Difference]: With dead ends: 695 [2025-03-17 05:45:06,717 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 05:45:06,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:45:06,719 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 517 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:06,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1218 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:45:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 05:45:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 316. [2025-03-17 05:45:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 267 states have (on average 1.3183520599250935) internal successors, (352), 269 states have internal predecessors, (352), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2025-03-17 05:45:06,740 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 135 [2025-03-17 05:45:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2025-03-17 05:45:06,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-17 05:45:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2025-03-17 05:45:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:45:06,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:06,744 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:06,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:45:06,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1798767096, now seen corresponding path program 1 times [2025-03-17 05:45:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295462480] [2025-03-17 05:45:06,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:06,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:45:06,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:45:06,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:06,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:45:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295462480] [2025-03-17 05:45:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295462480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28951769] [2025-03-17 05:45:06,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:06,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:06,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:06,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:45:06,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:45:06,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:45:06,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:06,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:07,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:45:07,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:07,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28951769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:45:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252815008] [2025-03-17 05:45:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:07,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:07,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:45:07,037 INFO L87 Difference]: Start difference. First operand 316 states and 440 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:07,074 INFO L93 Difference]: Finished difference Result 643 states and 895 transitions. [2025-03-17 05:45:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2025-03-17 05:45:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:07,076 INFO L225 Difference]: With dead ends: 643 [2025-03-17 05:45:07,077 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 05:45:07,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 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-17 05:45:07,078 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:07,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 05:45:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-17 05:45:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 279 states have (on average 1.3046594982078854) internal successors, (364), 281 states have internal predecessors, (364), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 452 transitions. [2025-03-17 05:45:07,107 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 452 transitions. Word has length 135 [2025-03-17 05:45:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:07,108 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 452 transitions. [2025-03-17 05:45:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2025-03-17 05:45:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:45:07,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:07,109 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:07,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:07,314 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,SelfDestructingSolverStorable5 [2025-03-17 05:45:07,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash -828920548, now seen corresponding path program 1 times [2025-03-17 05:45:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001902866] [2025-03-17 05:45:07,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:07,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:45:07,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:45:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001902866] [2025-03-17 05:45:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001902866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:45:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712600728] [2025-03-17 05:45:07,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:45:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:07,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:45:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:45:07,981 INFO L87 Difference]: Start difference. First operand 328 states and 452 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:08,962 INFO L93 Difference]: Finished difference Result 619 states and 848 transitions. [2025-03-17 05:45:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:45:08,963 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2025-03-17 05:45:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:08,967 INFO L225 Difference]: With dead ends: 619 [2025-03-17 05:45:08,968 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 05:45:08,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:45:08,970 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 400 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:08,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1494 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:45:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 05:45:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 343. [2025-03-17 05:45:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 294 states have (on average 1.316326530612245) internal successors, (387), 296 states have internal predecessors, (387), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 475 transitions. [2025-03-17 05:45:08,990 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 475 transitions. Word has length 136 [2025-03-17 05:45:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:08,991 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 475 transitions. [2025-03-17 05:45:08,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 475 transitions. [2025-03-17 05:45:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:45:08,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:08,992 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:08,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:45:08,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1625810654, now seen corresponding path program 1 times [2025-03-17 05:45:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603970552] [2025-03-17 05:45:08,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:45:09,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:45:09,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:09,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603970552] [2025-03-17 05:45:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603970552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:45:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183684613] [2025-03-17 05:45:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:45:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:45:09,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:45:09,823 INFO L87 Difference]: Start difference. First operand 343 states and 475 transitions. Second operand has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:45:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:10,748 INFO L93 Difference]: Finished difference Result 718 states and 993 transitions. [2025-03-17 05:45:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:45:10,749 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2025-03-17 05:45:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:10,752 INFO L225 Difference]: With dead ends: 718 [2025-03-17 05:45:10,752 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 05:45:10,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:45:10,754 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 411 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:10,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1109 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:45:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 05:45:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 326. [2025-03-17 05:45:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 279 states have internal predecessors, (365), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 453 transitions. [2025-03-17 05:45:10,774 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 453 transitions. Word has length 136 [2025-03-17 05:45:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 453 transitions. [2025-03-17 05:45:10,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:45:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 453 transitions. [2025-03-17 05:45:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:45:10,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:10,776 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:10,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:45:10,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:10,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1538494215, now seen corresponding path program 1 times [2025-03-17 05:45:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687860375] [2025-03-17 05:45:10,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:45:10,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:45:10,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687860375] [2025-03-17 05:45:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687860375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:45:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969029655] [2025-03-17 05:45:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:11,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:45:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:11,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:45:11,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:45:11,243 INFO L87 Difference]: Start difference. First operand 326 states and 453 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:11,619 INFO L93 Difference]: Finished difference Result 686 states and 949 transitions. [2025-03-17 05:45:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:45:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:45:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:11,621 INFO L225 Difference]: With dead ends: 686 [2025-03-17 05:45:11,621 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 05:45:11,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:45:11,623 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 57 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:11,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1687 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 05:45:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 329. [2025-03-17 05:45:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.3107142857142857) internal successors, (367), 282 states have internal predecessors, (367), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:45:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 455 transitions. [2025-03-17 05:45:11,643 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 455 transitions. Word has length 137 [2025-03-17 05:45:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:11,643 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 455 transitions. [2025-03-17 05:45:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 455 transitions. [2025-03-17 05:45:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:45:11,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:11,646 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:45:11,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:11,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash 30880794, now seen corresponding path program 1 times [2025-03-17 05:45:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:11,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494291468] [2025-03-17 05:45:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:11,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:45:11,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:45:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:11,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494291468] [2025-03-17 05:45:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494291468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:45:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048980937] [2025-03-17 05:45:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:45:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:45:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:45:12,053 INFO L87 Difference]: Start difference. First operand 329 states and 455 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:12,500 INFO L93 Difference]: Finished difference Result 942 states and 1291 transitions. [2025-03-17 05:45:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:45:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 137 [2025-03-17 05:45:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:12,503 INFO L225 Difference]: With dead ends: 942 [2025-03-17 05:45:12,503 INFO L226 Difference]: Without dead ends: 614 [2025-03-17 05:45:12,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:45:12,504 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 635 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:12,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 643 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:45:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-17 05:45:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 592. [2025-03-17 05:45:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 489 states have (on average 1.2842535787321063) internal successors, (628), 494 states have internal predecessors, (628), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 05:45:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 812 transitions. [2025-03-17 05:45:12,536 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 812 transitions. Word has length 137 [2025-03-17 05:45:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:12,536 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 812 transitions. [2025-03-17 05:45:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 812 transitions. [2025-03-17 05:45:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:45:12,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:12,537 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:45:12,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1498218572, now seen corresponding path program 1 times [2025-03-17 05:45:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691271273] [2025-03-17 05:45:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:12,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:45:12,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:45:12,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:12,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691271273] [2025-03-17 05:45:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691271273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:12,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:45:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197779090] [2025-03-17 05:45:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:12,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:45:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:12,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:45:12,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:12,811 INFO L87 Difference]: Start difference. First operand 592 states and 812 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:12,926 INFO L93 Difference]: Finished difference Result 1015 states and 1348 transitions. [2025-03-17 05:45:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:45:12,926 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:45:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:12,941 INFO L225 Difference]: With dead ends: 1015 [2025-03-17 05:45:12,942 INFO L226 Difference]: Without dead ends: 1013 [2025-03-17 05:45:12,943 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-17 05:45:12,944 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 56 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:12,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 799 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-17 05:45:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 819. [2025-03-17 05:45:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 702 states have (on average 1.2621082621082622) internal successors, (886), 709 states have internal predecessors, (886), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 97 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:45:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1094 transitions. [2025-03-17 05:45:13,008 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1094 transitions. Word has length 137 [2025-03-17 05:45:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1094 transitions. [2025-03-17 05:45:13,009 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1094 transitions. [2025-03-17 05:45:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:45:13,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:13,012 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:13,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:45:13,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:13,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1653199480, now seen corresponding path program 1 times [2025-03-17 05:45:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:13,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614373712] [2025-03-17 05:45:13,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:13,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:45:13,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:45:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614373712] [2025-03-17 05:45:13,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614373712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:13,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:13,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:45:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596130427] [2025-03-17 05:45:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:45:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:13,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:45:13,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:13,271 INFO L87 Difference]: Start difference. First operand 819 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:13,413 INFO L93 Difference]: Finished difference Result 1702 states and 2275 transitions. [2025-03-17 05:45:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:45:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-17 05:45:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:13,420 INFO L225 Difference]: With dead ends: 1702 [2025-03-17 05:45:13,420 INFO L226 Difference]: Without dead ends: 1217 [2025-03-17 05:45:13,421 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-17 05:45:13,422 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 73 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:13,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 999 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-17 05:45:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1195. [2025-03-17 05:45:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1036 states have (on average 1.2683397683397684) internal successors, (1314), 1049 states have internal predecessors, (1314), 140 states have call successors, (140), 18 states have call predecessors, (140), 18 states have return successors, (140), 127 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 05:45:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1594 transitions. [2025-03-17 05:45:13,480 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1594 transitions. Word has length 138 [2025-03-17 05:45:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:13,481 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1594 transitions. [2025-03-17 05:45:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1594 transitions. [2025-03-17 05:45:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:45:13,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:13,482 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:13,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:45:13,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:13,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1054531543, now seen corresponding path program 1 times [2025-03-17 05:45:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:13,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032609594] [2025-03-17 05:45:13,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:13,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:45:13,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:45:13,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:13,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032609594] [2025-03-17 05:45:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032609594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910906459] [2025-03-17 05:45:13,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:13,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:13,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:13,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:13,591 INFO L87 Difference]: Start difference. First operand 1195 states and 1594 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:13,712 INFO L93 Difference]: Finished difference Result 2784 states and 3699 transitions. [2025-03-17 05:45:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-17 05:45:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:13,719 INFO L225 Difference]: With dead ends: 2784 [2025-03-17 05:45:13,719 INFO L226 Difference]: Without dead ends: 1590 [2025-03-17 05:45:13,721 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-17 05:45:13,722 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 76 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:13,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 598 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-17 05:45:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1584. [2025-03-17 05:45:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1359 states have (on average 1.2501839587932304) internal successors, (1699), 1379 states have internal predecessors, (1699), 196 states have call successors, (196), 28 states have call predecessors, (196), 28 states have return successors, (196), 176 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 05:45:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2091 transitions. [2025-03-17 05:45:13,802 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2091 transitions. Word has length 139 [2025-03-17 05:45:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2091 transitions. [2025-03-17 05:45:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2091 transitions. [2025-03-17 05:45:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:45:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:13,806 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:45:13,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -783836631, now seen corresponding path program 1 times [2025-03-17 05:45:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468862822] [2025-03-17 05:45:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:13,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:45:13,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:45:13,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:13,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468862822] [2025-03-17 05:45:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468862822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:14,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:45:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257352450] [2025-03-17 05:45:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:45:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:14,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:45:14,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:14,142 INFO L87 Difference]: Start difference. First operand 1584 states and 2091 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:14,564 INFO L93 Difference]: Finished difference Result 3630 states and 4768 transitions. [2025-03-17 05:45:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:45:14,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-17 05:45:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:14,572 INFO L225 Difference]: With dead ends: 3630 [2025-03-17 05:45:14,573 INFO L226 Difference]: Without dead ends: 2047 [2025-03-17 05:45:14,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:45:14,577 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 242 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:14,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 615 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:45:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-17 05:45:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1888. [2025-03-17 05:45:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1663 states have (on average 1.2405291641611544) internal successors, (2063), 1683 states have internal predecessors, (2063), 196 states have call successors, (196), 28 states have call predecessors, (196), 28 states have return successors, (196), 176 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 05:45:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2455 transitions. [2025-03-17 05:45:14,684 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2455 transitions. Word has length 139 [2025-03-17 05:45:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:14,685 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2455 transitions. [2025-03-17 05:45:14,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2455 transitions. [2025-03-17 05:45:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:45:14,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:14,687 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:45:14,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 682943259, now seen corresponding path program 1 times [2025-03-17 05:45:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18585306] [2025-03-17 05:45:14,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:45:14,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:45:14,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:14,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18585306] [2025-03-17 05:45:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18585306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113262481] [2025-03-17 05:45:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:14,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:14,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:14,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:14,810 INFO L87 Difference]: Start difference. First operand 1888 states and 2455 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:14,940 INFO L93 Difference]: Finished difference Result 3148 states and 4103 transitions. [2025-03-17 05:45:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:14,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-17 05:45:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:14,947 INFO L225 Difference]: With dead ends: 3148 [2025-03-17 05:45:14,948 INFO L226 Difference]: Without dead ends: 1866 [2025-03-17 05:45:14,950 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-17 05:45:14,951 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 72 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:14,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 686 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-03-17 05:45:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1862. [2025-03-17 05:45:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1631 states have (on average 1.2323727774371551) internal successors, (2010), 1651 states have internal predecessors, (2010), 200 states have call successors, (200), 30 states have call predecessors, (200), 30 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 05:45:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2410 transitions. [2025-03-17 05:45:15,074 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2410 transitions. Word has length 140 [2025-03-17 05:45:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:15,074 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2410 transitions. [2025-03-17 05:45:15,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2410 transitions. [2025-03-17 05:45:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:45:15,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:15,077 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:15,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:45:15,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:15,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1606781465, now seen corresponding path program 1 times [2025-03-17 05:45:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054070950] [2025-03-17 05:45:15,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:45:15,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:45:15,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:15,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054070950] [2025-03-17 05:45:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054070950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:16,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:16,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-17 05:45:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082957560] [2025-03-17 05:45:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:16,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 05:45:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:16,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 05:45:16,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:45:16,361 INFO L87 Difference]: Start difference. First operand 1862 states and 2410 transitions. Second operand has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 24 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-17 05:45:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:18,339 INFO L93 Difference]: Finished difference Result 3782 states and 4887 transitions. [2025-03-17 05:45:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:45:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 24 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) Word has length 140 [2025-03-17 05:45:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:18,348 INFO L225 Difference]: With dead ends: 3782 [2025-03-17 05:45:18,349 INFO L226 Difference]: Without dead ends: 1921 [2025-03-17 05:45:18,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=290, Invalid=1516, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:45:18,353 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 773 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:18,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1328 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:45:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-17 05:45:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1845. [2025-03-17 05:45:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1614 states have (on average 1.2342007434944238) internal successors, (1992), 1634 states have internal predecessors, (1992), 200 states have call successors, (200), 30 states have call predecessors, (200), 30 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 05:45:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2392 transitions. [2025-03-17 05:45:18,435 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2392 transitions. Word has length 140 [2025-03-17 05:45:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:18,436 INFO L471 AbstractCegarLoop]: Abstraction has 1845 states and 2392 transitions. [2025-03-17 05:45:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 24 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-17 05:45:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2392 transitions. [2025-03-17 05:45:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:45:18,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:18,438 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:18,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:45:18,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:18,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2121955392, now seen corresponding path program 1 times [2025-03-17 05:45:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292460596] [2025-03-17 05:45:18,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:18,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:45:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:45:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292460596] [2025-03-17 05:45:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292460596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:18,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:45:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006063796] [2025-03-17 05:45:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:45:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:18,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:45:18,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:45:18,755 INFO L87 Difference]: Start difference. First operand 1845 states and 2392 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:19,098 INFO L93 Difference]: Finished difference Result 3684 states and 4764 transitions. [2025-03-17 05:45:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:45:19,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-03-17 05:45:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:19,107 INFO L225 Difference]: With dead ends: 3684 [2025-03-17 05:45:19,107 INFO L226 Difference]: Without dead ends: 1840 [2025-03-17 05:45:19,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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-17 05:45:19,111 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 328 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:19,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 423 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-17 05:45:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1324. [2025-03-17 05:45:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1175 states have (on average 1.2229787234042553) internal successors, (1437), 1189 states have internal predecessors, (1437), 126 states have call successors, (126), 22 states have call predecessors, (126), 22 states have return successors, (126), 112 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:45:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1689 transitions. [2025-03-17 05:45:19,185 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1689 transitions. Word has length 141 [2025-03-17 05:45:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:19,186 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1689 transitions. [2025-03-17 05:45:19,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1689 transitions. [2025-03-17 05:45:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:45:19,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:19,188 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:19,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:45:19,188 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 888673466, now seen corresponding path program 1 times [2025-03-17 05:45:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185716977] [2025-03-17 05:45:19,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:19,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:45:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:45:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185716977] [2025-03-17 05:45:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185716977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:45:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964847951] [2025-03-17 05:45:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:45:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:19,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:45:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:19,494 INFO L87 Difference]: Start difference. First operand 1324 states and 1689 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:19,771 INFO L93 Difference]: Finished difference Result 3016 states and 3841 transitions. [2025-03-17 05:45:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:45:19,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:45:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:19,778 INFO L225 Difference]: With dead ends: 3016 [2025-03-17 05:45:19,779 INFO L226 Difference]: Without dead ends: 1693 [2025-03-17 05:45:19,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:45:19,783 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 63 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:19,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1299 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-03-17 05:45:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1496. [2025-03-17 05:45:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1347 states have (on average 1.2264291017074982) internal successors, (1652), 1361 states have internal predecessors, (1652), 126 states have call successors, (126), 22 states have call predecessors, (126), 22 states have return successors, (126), 112 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:45:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1904 transitions. [2025-03-17 05:45:19,870 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1904 transitions. Word has length 141 [2025-03-17 05:45:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:19,870 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1904 transitions. [2025-03-17 05:45:19,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1904 transitions. [2025-03-17 05:45:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:45:19,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:19,873 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:19,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:45:19,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:19,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2133437947, now seen corresponding path program 1 times [2025-03-17 05:45:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362001172] [2025-03-17 05:45:19,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:19,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:45:19,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:45:19,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:19,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362001172] [2025-03-17 05:45:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362001172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:19,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118210240] [2025-03-17 05:45:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:19,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:19,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:19,973 INFO L87 Difference]: Start difference. First operand 1496 states and 1904 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:20,087 INFO L93 Difference]: Finished difference Result 3041 states and 3871 transitions. [2025-03-17 05:45:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:20,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:45:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:20,092 INFO L225 Difference]: With dead ends: 3041 [2025-03-17 05:45:20,092 INFO L226 Difference]: Without dead ends: 1546 [2025-03-17 05:45:20,094 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-17 05:45:20,094 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 79 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:20,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 603 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-17 05:45:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1542. [2025-03-17 05:45:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1370 states have (on average 1.2153284671532847) internal successors, (1665), 1386 states have internal predecessors, (1665), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1953 transitions. [2025-03-17 05:45:20,157 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1953 transitions. Word has length 141 [2025-03-17 05:45:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1953 transitions. [2025-03-17 05:45:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1953 transitions. [2025-03-17 05:45:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:45:20,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:20,159 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:20,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:45:20,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1917178569, now seen corresponding path program 1 times [2025-03-17 05:45:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658286862] [2025-03-17 05:45:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:20,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:45:20,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:45:20,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:20,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:21,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658286862] [2025-03-17 05:45:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658286862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 05:45:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802713638] [2025-03-17 05:45:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:45:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:21,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:45:21,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:45:21,428 INFO L87 Difference]: Start difference. First operand 1542 states and 1953 transitions. Second operand has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 05:45:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:23,402 INFO L93 Difference]: Finished difference Result 3206 states and 4057 transitions. [2025-03-17 05:45:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:45:23,403 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 141 [2025-03-17 05:45:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:23,410 INFO L225 Difference]: With dead ends: 3206 [2025-03-17 05:45:23,410 INFO L226 Difference]: Without dead ends: 1665 [2025-03-17 05:45:23,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:45:23,416 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 316 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:23,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1080 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:45:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-17 05:45:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1533. [2025-03-17 05:45:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1361 states have (on average 1.2152828802351212) internal successors, (1654), 1377 states have internal predecessors, (1654), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1942 transitions. [2025-03-17 05:45:23,509 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1942 transitions. Word has length 141 [2025-03-17 05:45:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1942 transitions. [2025-03-17 05:45:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 05:45:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1942 transitions. [2025-03-17 05:45:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:45:23,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:23,512 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:45:23,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -917673104, now seen corresponding path program 1 times [2025-03-17 05:45:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71025513] [2025-03-17 05:45:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:45:23,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:45:23,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:23,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71025513] [2025-03-17 05:45:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71025513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:23,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147546043] [2025-03-17 05:45:23,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:23,729 INFO L87 Difference]: Start difference. First operand 1533 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:23,911 INFO L93 Difference]: Finished difference Result 3032 states and 3829 transitions. [2025-03-17 05:45:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:45:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:23,917 INFO L225 Difference]: With dead ends: 3032 [2025-03-17 05:45:23,917 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 05:45:23,919 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-17 05:45:23,921 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 22 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:23,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 423 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 05:45:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1479. [2025-03-17 05:45:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1307 states have (on average 1.1981637337413924) internal successors, (1566), 1323 states have internal predecessors, (1566), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1854 transitions. [2025-03-17 05:45:24,056 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1854 transitions. Word has length 141 [2025-03-17 05:45:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1854 transitions. [2025-03-17 05:45:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1854 transitions. [2025-03-17 05:45:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:45:24,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:24,064 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:45:24,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2034804437, now seen corresponding path program 1 times [2025-03-17 05:45:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729436010] [2025-03-17 05:45:24,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:45:24,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:45:24,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:24,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:24,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729436010] [2025-03-17 05:45:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729436010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:24,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:24,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604262724] [2025-03-17 05:45:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:24,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:24,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:24,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:24,317 INFO L87 Difference]: Start difference. First operand 1479 states and 1854 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:24,465 INFO L93 Difference]: Finished difference Result 2978 states and 3729 transitions. [2025-03-17 05:45:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:24,466 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:45:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:24,474 INFO L225 Difference]: With dead ends: 2978 [2025-03-17 05:45:24,474 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 05:45:24,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:24,478 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 33 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:24,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 05:45:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1253. [2025-03-17 05:45:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1081 states have (on average 1.1998149861239593) internal successors, (1297), 1097 states have internal predecessors, (1297), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1585 transitions. [2025-03-17 05:45:24,566 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1585 transitions. Word has length 143 [2025-03-17 05:45:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:24,566 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1585 transitions. [2025-03-17 05:45:24,566 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1585 transitions. [2025-03-17 05:45:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:45:24,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:24,568 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:24,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:45:24,568 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:24,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 746442445, now seen corresponding path program 1 times [2025-03-17 05:45:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170875992] [2025-03-17 05:45:24,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:24,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:24,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:45:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:45:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170875992] [2025-03-17 05:45:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170875992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:25,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 05:45:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289625646] [2025-03-17 05:45:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:45:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:25,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:45:25,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:45:25,477 INFO L87 Difference]: Start difference. First operand 1253 states and 1585 transitions. Second operand has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:26,540 INFO L93 Difference]: Finished difference Result 1928 states and 2383 transitions. [2025-03-17 05:45:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 05:45:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2025-03-17 05:45:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:26,546 INFO L225 Difference]: With dead ends: 1928 [2025-03-17 05:45:26,547 INFO L226 Difference]: Without dead ends: 1926 [2025-03-17 05:45:26,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 05:45:26,548 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 290 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:26,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1597 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:45:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-03-17 05:45:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1577. [2025-03-17 05:45:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1405 states have (on average 1.195017793594306) internal successors, (1679), 1421 states have internal predecessors, (1679), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1967 transitions. [2025-03-17 05:45:26,616 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1967 transitions. Word has length 143 [2025-03-17 05:45:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 1967 transitions. [2025-03-17 05:45:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:45:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1967 transitions. [2025-03-17 05:45:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:45:26,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:26,619 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:45:26,619 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -257086639, now seen corresponding path program 1 times [2025-03-17 05:45:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314343852] [2025-03-17 05:45:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:45:26,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:45:26,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:26,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314343852] [2025-03-17 05:45:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314343852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:45:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381121505] [2025-03-17 05:45:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:26,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:45:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:26,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:45:26,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:26,863 INFO L87 Difference]: Start difference. First operand 1577 states and 1967 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:27,065 INFO L93 Difference]: Finished difference Result 3600 states and 4449 transitions. [2025-03-17 05:45:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:45:27,067 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:45:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:27,074 INFO L225 Difference]: With dead ends: 3600 [2025-03-17 05:45:27,075 INFO L226 Difference]: Without dead ends: 2024 [2025-03-17 05:45:27,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:45:27,077 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:27,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 736 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2025-03-17 05:45:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1841. [2025-03-17 05:45:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1669 states have (on average 1.177351707609347) internal successors, (1965), 1685 states have internal predecessors, (1965), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:45:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2253 transitions. [2025-03-17 05:45:27,159 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2253 transitions. Word has length 143 [2025-03-17 05:45:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:27,159 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2253 transitions. [2025-03-17 05:45:27,160 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2253 transitions. [2025-03-17 05:45:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:45:27,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:27,161 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:27,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:45:27,162 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1991206926, now seen corresponding path program 1 times [2025-03-17 05:45:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:27,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347300199] [2025-03-17 05:45:27,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:45:27,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:45:27,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:27,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347300199] [2025-03-17 05:45:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347300199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964252314] [2025-03-17 05:45:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:27,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:27,277 INFO L87 Difference]: Start difference. First operand 1841 states and 2253 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:27,448 INFO L93 Difference]: Finished difference Result 4071 states and 4988 transitions. [2025-03-17 05:45:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:27,448 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:45:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:27,456 INFO L225 Difference]: With dead ends: 4071 [2025-03-17 05:45:27,456 INFO L226 Difference]: Without dead ends: 2231 [2025-03-17 05:45:27,459 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-17 05:45:27,459 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 57 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:27,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 558 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-03-17 05:45:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1901. [2025-03-17 05:45:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1709 states have (on average 1.1726155646576946) internal successors, (2004), 1727 states have internal predecessors, (2004), 160 states have call successors, (160), 31 states have call predecessors, (160), 31 states have return successors, (160), 142 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-17 05:45:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2324 transitions. [2025-03-17 05:45:27,567 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2324 transitions. Word has length 143 [2025-03-17 05:45:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:27,568 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2324 transitions. [2025-03-17 05:45:27,568 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:45:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2324 transitions. [2025-03-17 05:45:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:45:27,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:27,570 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:27,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:45:27,570 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:27,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1258331019, now seen corresponding path program 1 times [2025-03-17 05:45:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:27,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765140963] [2025-03-17 05:45:27,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:27,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:45:27,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:45:27,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:27,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:45:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765140963] [2025-03-17 05:45:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765140963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:29,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-17 05:45:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608163823] [2025-03-17 05:45:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:29,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 05:45:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:29,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 05:45:29,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:45:29,976 INFO L87 Difference]: Start difference. First operand 1901 states and 2324 transitions. Second operand has 28 states, 25 states have (on average 2.28) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-17 05:45:36,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:45:41,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:45:45,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:45:51,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:46:14,008 WARN L286 SmtUtils]: Spent 21.42s on a formula simplification. DAG size of input: 201 DAG size of output: 197 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)