./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07df7c2ca2abed9bcd09481b78e93a7ff3ff9af974a044cb3d572c2018ab9c02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:55:26,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:55:26,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:55:26,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:55:26,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:55:26,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:55:26,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:55:26,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:55:26,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:55:26,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:55:26,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:55:26,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:55:26,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:55:26,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:55:26,334 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:55:26,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:55:26,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:26,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:26,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:26,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:55:26,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:55:26,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07df7c2ca2abed9bcd09481b78e93a7ff3ff9af974a044cb3d572c2018ab9c02 [2025-01-09 04:55:26,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:55:26,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:55:26,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:55:26,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:55:26,618 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:55:26,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:55:27,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404eebcb4/e0b1929c158c4a248e25105b2f732ce9/FLAGad1daf456 [2025-01-09 04:55:28,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:55:28,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:55:28,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404eebcb4/e0b1929c158c4a248e25105b2f732ce9/FLAGad1daf456 [2025-01-09 04:55:28,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404eebcb4/e0b1929c158c4a248e25105b2f732ce9 [2025-01-09 04:55:28,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:55:28,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:55:28,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:28,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:55:28,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:55:28,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:28" (1/1) ... [2025-01-09 04:55:28,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520af962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:28, skipping insertion in model container [2025-01-09 04:55:28,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:28" (1/1) ... [2025-01-09 04:55:29,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:55:29,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2025-01-09 04:55:29,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2025-01-09 04:55:29,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2025-01-09 04:55:29,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2025-01-09 04:55:29,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2025-01-09 04:55:29,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2025-01-09 04:55:29,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2025-01-09 04:55:29,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2025-01-09 04:55:29,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2025-01-09 04:55:29,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2025-01-09 04:55:29,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2025-01-09 04:55:29,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2025-01-09 04:55:29,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2025-01-09 04:55:29,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2025-01-09 04:55:29,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2025-01-09 04:55:29,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2025-01-09 04:55:29,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2025-01-09 04:55:29,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2025-01-09 04:55:29,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2025-01-09 04:55:29,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2025-01-09 04:55:29,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2025-01-09 04:55:29,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2025-01-09 04:55:29,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2025-01-09 04:55:29,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2025-01-09 04:55:29,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2025-01-09 04:55:29,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2025-01-09 04:55:29,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2025-01-09 04:55:29,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2025-01-09 04:55:29,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2025-01-09 04:55:29,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2025-01-09 04:55:29,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2025-01-09 04:55:29,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2025-01-09 04:55:29,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2025-01-09 04:55:29,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2025-01-09 04:55:29,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2025-01-09 04:55:29,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2025-01-09 04:55:30,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2025-01-09 04:55:30,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:30,753 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:55:30,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2025-01-09 04:55:30,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2025-01-09 04:55:30,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2025-01-09 04:55:30,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2025-01-09 04:55:30,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2025-01-09 04:55:30,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2025-01-09 04:55:30,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2025-01-09 04:55:30,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2025-01-09 04:55:30,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2025-01-09 04:55:30,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2025-01-09 04:55:30,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2025-01-09 04:55:30,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2025-01-09 04:55:30,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2025-01-09 04:55:30,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2025-01-09 04:55:30,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2025-01-09 04:55:30,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2025-01-09 04:55:30,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2025-01-09 04:55:30,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2025-01-09 04:55:30,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2025-01-09 04:55:30,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2025-01-09 04:55:30,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2025-01-09 04:55:30,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2025-01-09 04:55:30,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2025-01-09 04:55:30,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2025-01-09 04:55:30,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2025-01-09 04:55:30,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2025-01-09 04:55:30,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2025-01-09 04:55:31,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2025-01-09 04:55:31,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2025-01-09 04:55:31,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2025-01-09 04:55:31,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2025-01-09 04:55:31,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2025-01-09 04:55:31,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2025-01-09 04:55:31,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2025-01-09 04:55:31,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2025-01-09 04:55:31,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2025-01-09 04:55:31,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2025-01-09 04:55:31,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:31,857 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:55:31,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31 WrapperNode [2025-01-09 04:55:31,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:31,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:31,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:55:31,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:55:31,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:31,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,235 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24721 [2025-01-09 04:55:32,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:32,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:55:32,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:55:32,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:55:32,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:55:32,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:55:32,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:55:32,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:55:32,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:55:32,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (1/1) ... [2025-01-09 04:55:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:33,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:55:33,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:55:33,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:55:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:55:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:55:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:55:33,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:55:33,481 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:55:33,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:55:40,755 INFO L? ?]: Removed 3580 outVars from TransFormulas that were not future-live. [2025-01-09 04:55:40,755 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:55:40,810 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:55:40,811 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:55:40,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:40 BoogieIcfgContainer [2025-01-09 04:55:40,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:55:40,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:55:40,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:55:40,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:55:40,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:55:28" (1/3) ... [2025-01-09 04:55:40,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d2e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:40, skipping insertion in model container [2025-01-09 04:55:40,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:31" (2/3) ... [2025-01-09 04:55:40,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d2e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:40, skipping insertion in model container [2025-01-09 04:55:40,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:40" (3/3) ... [2025-01-09 04:55:40,821 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:55:40,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:55:40,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 3854 locations, 1 initial locations, 0 loop locations, and 37 error locations. [2025-01-09 04:55:40,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:55:40,956 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;@226541b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:55:40,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 04:55:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 3854 states, 3816 states have (on average 1.874475890985325) internal successors, (7153), 3853 states have internal predecessors, (7153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:55:41,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:41,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:41,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:41,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -150150757, now seen corresponding path program 1 times [2025-01-09 04:55:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217170013] [2025-01-09 04:55:41,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:41,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:55:41,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:55:41,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:41,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217170013] [2025-01-09 04:55:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217170013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:41,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484588526] [2025-01-09 04:55:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:41,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:41,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:41,698 INFO L87 Difference]: Start difference. First operand has 3854 states, 3816 states have (on average 1.874475890985325) internal successors, (7153), 3853 states have internal predecessors, (7153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:44,006 INFO L93 Difference]: Finished difference Result 6602 states and 11760 transitions. [2025-01-09 04:55:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-01-09 04:55:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:44,028 INFO L225 Difference]: With dead ends: 6602 [2025-01-09 04:55:44,028 INFO L226 Difference]: Without dead ends: 3827 [2025-01-09 04:55:44,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:44,037 INFO L435 NwaCegarLoop]: 3381 mSDtfsCounter, 18407 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18407 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:44,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18407 Valid, 4385 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:55:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2025-01-09 04:55:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3701. [2025-01-09 04:55:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3664 states have (on average 1.3788209606986899) internal successors, (5052), 3700 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5052 transitions. [2025-01-09 04:55:44,135 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5052 transitions. Word has length 116 [2025-01-09 04:55:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:44,135 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 5052 transitions. [2025-01-09 04:55:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5052 transitions. [2025-01-09 04:55:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 04:55:44,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:44,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:55:44,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1021046553, now seen corresponding path program 1 times [2025-01-09 04:55:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783622551] [2025-01-09 04:55:44,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 04:55:44,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 04:55:44,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:44,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783622551] [2025-01-09 04:55:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783622551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576200524] [2025-01-09 04:55:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:44,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:44,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:44,498 INFO L87 Difference]: Start difference. First operand 3701 states and 5052 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:45,719 INFO L93 Difference]: Finished difference Result 6314 states and 8889 transitions. [2025-01-09 04:55:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-01-09 04:55:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:45,740 INFO L225 Difference]: With dead ends: 6314 [2025-01-09 04:55:45,743 INFO L226 Difference]: Without dead ends: 3213 [2025-01-09 04:55:45,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:45,755 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 9421 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9421 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:45,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9421 Valid, 1792 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:55:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2025-01-09 04:55:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3213. [2025-01-09 04:55:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 3176 states have (on average 1.4162468513853905) internal successors, (4498), 3212 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4498 transitions. [2025-01-09 04:55:45,884 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4498 transitions. Word has length 117 [2025-01-09 04:55:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:45,889 INFO L471 AbstractCegarLoop]: Abstraction has 3213 states and 4498 transitions. [2025-01-09 04:55:45,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4498 transitions. [2025-01-09 04:55:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 04:55:45,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:45,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:45,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:55:45,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1704632037, now seen corresponding path program 1 times [2025-01-09 04:55:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509404061] [2025-01-09 04:55:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 04:55:46,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 04:55:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:46,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509404061] [2025-01-09 04:55:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509404061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:46,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893253328] [2025-01-09 04:55:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:46,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:46,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:46,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:46,200 INFO L87 Difference]: Start difference. First operand 3213 states and 4498 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:47,687 INFO L93 Difference]: Finished difference Result 5826 states and 8333 transitions. [2025-01-09 04:55:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-09 04:55:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:47,707 INFO L225 Difference]: With dead ends: 5826 [2025-01-09 04:55:47,711 INFO L226 Difference]: Without dead ends: 3053 [2025-01-09 04:55:47,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:47,719 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 8707 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8707 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:47,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8707 Valid, 1268 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:55:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-01-09 04:55:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2025-01-09 04:55:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3053 states, 3016 states have (on average 1.427055702917772) internal successors, (4304), 3052 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4304 transitions. [2025-01-09 04:55:47,777 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4304 transitions. Word has length 118 [2025-01-09 04:55:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:47,777 INFO L471 AbstractCegarLoop]: Abstraction has 3053 states and 4304 transitions. [2025-01-09 04:55:47,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4304 transitions. [2025-01-09 04:55:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:55:47,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:47,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:55:47,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:47,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash 46418268, now seen corresponding path program 1 times [2025-01-09 04:55:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892028093] [2025-01-09 04:55:47,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:55:47,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:55:47,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:47,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892028093] [2025-01-09 04:55:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892028093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:47,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:47,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949891234] [2025-01-09 04:55:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:47,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:47,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:47,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:47,997 INFO L87 Difference]: Start difference. First operand 3053 states and 4304 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:49,178 INFO L93 Difference]: Finished difference Result 5666 states and 8137 transitions. [2025-01-09 04:55:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 04:55:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:49,186 INFO L225 Difference]: With dead ends: 5666 [2025-01-09 04:55:49,186 INFO L226 Difference]: Without dead ends: 2925 [2025-01-09 04:55:49,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:49,188 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 8338 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8338 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:49,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8338 Valid, 1401 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:55:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2025-01-09 04:55:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2925. [2025-01-09 04:55:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2888 states have (on average 1.4397506925207757) internal successors, (4158), 2924 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4158 transitions. [2025-01-09 04:55:49,216 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4158 transitions. Word has length 119 [2025-01-09 04:55:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:49,216 INFO L471 AbstractCegarLoop]: Abstraction has 2925 states and 4158 transitions. [2025-01-09 04:55:49,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4158 transitions. [2025-01-09 04:55:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:55:49,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:49,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:49,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:55:49,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:49,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1481188516, now seen corresponding path program 1 times [2025-01-09 04:55:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686408012] [2025-01-09 04:55:49,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:49,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:55:49,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:55:49,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:49,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686408012] [2025-01-09 04:55:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686408012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740555268] [2025-01-09 04:55:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:49,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:49,372 INFO L87 Difference]: Start difference. First operand 2925 states and 4158 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:50,241 INFO L93 Difference]: Finished difference Result 5538 states and 7989 transitions. [2025-01-09 04:55:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:55:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:50,247 INFO L225 Difference]: With dead ends: 5538 [2025-01-09 04:55:50,247 INFO L226 Difference]: Without dead ends: 2813 [2025-01-09 04:55:50,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:50,255 INFO L435 NwaCegarLoop]: 1460 mSDtfsCounter, 8062 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8062 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:50,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8062 Valid, 1488 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:55:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2025-01-09 04:55:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2025-01-09 04:55:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2776 states have (on average 1.4538904899135447) internal successors, (4036), 2812 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4036 transitions. [2025-01-09 04:55:50,301 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4036 transitions. Word has length 120 [2025-01-09 04:55:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:50,301 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 4036 transitions. [2025-01-09 04:55:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4036 transitions. [2025-01-09 04:55:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:55:50,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:50,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:50,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:55:50,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:50,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1088659095, now seen corresponding path program 1 times [2025-01-09 04:55:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:50,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349442338] [2025-01-09 04:55:50,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:50,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:55:50,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:55:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:50,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:50,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349442338] [2025-01-09 04:55:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349442338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20441791] [2025-01-09 04:55:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:50,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:50,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:50,511 INFO L87 Difference]: Start difference. First operand 2813 states and 4036 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:51,451 INFO L93 Difference]: Finished difference Result 5426 states and 7865 transitions. [2025-01-09 04:55:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 04:55:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:51,458 INFO L225 Difference]: With dead ends: 5426 [2025-01-09 04:55:51,459 INFO L226 Difference]: Without dead ends: 2748 [2025-01-09 04:55:51,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:51,463 INFO L435 NwaCegarLoop]: 1443 mSDtfsCounter, 7878 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7878 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:51,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7878 Valid, 1455 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:55:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2025-01-09 04:55:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2748. [2025-01-09 04:55:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2711 states have (on average 1.4625599409811878) internal successors, (3965), 2747 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3965 transitions. [2025-01-09 04:55:51,501 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3965 transitions. Word has length 121 [2025-01-09 04:55:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:51,501 INFO L471 AbstractCegarLoop]: Abstraction has 2748 states and 3965 transitions. [2025-01-09 04:55:51,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3965 transitions. [2025-01-09 04:55:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:55:51,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:51,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:55:51,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:51,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:51,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1122787720, now seen corresponding path program 1 times [2025-01-09 04:55:51,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:51,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153434395] [2025-01-09 04:55:51,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:51,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:51,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:55:51,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:55:51,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:51,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153434395] [2025-01-09 04:55:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153434395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:51,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800225952] [2025-01-09 04:55:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:51,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:51,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:51,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:51,677 INFO L87 Difference]: Start difference. First operand 2748 states and 3965 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:52,710 INFO L93 Difference]: Finished difference Result 5361 states and 7792 transitions. [2025-01-09 04:55:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 04:55:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:52,718 INFO L225 Difference]: With dead ends: 5361 [2025-01-09 04:55:52,718 INFO L226 Difference]: Without dead ends: 2717 [2025-01-09 04:55:52,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:52,721 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 7763 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7763 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:52,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7763 Valid, 1440 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:55:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2025-01-09 04:55:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2717. [2025-01-09 04:55:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2680 states have (on average 1.4664179104477613) internal successors, (3930), 2716 states have internal predecessors, (3930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3930 transitions. [2025-01-09 04:55:52,763 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3930 transitions. Word has length 122 [2025-01-09 04:55:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:52,764 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3930 transitions. [2025-01-09 04:55:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3930 transitions. [2025-01-09 04:55:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 04:55:52,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:52,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:52,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:55:52,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:52,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -204963786, now seen corresponding path program 1 times [2025-01-09 04:55:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401496435] [2025-01-09 04:55:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:52,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 04:55:52,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 04:55:52,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:52,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401496435] [2025-01-09 04:55:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401496435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398452632] [2025-01-09 04:55:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:52,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:52,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:52,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:52,952 INFO L87 Difference]: Start difference. First operand 2717 states and 3930 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:53,968 INFO L93 Difference]: Finished difference Result 5330 states and 7755 transitions. [2025-01-09 04:55:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:53,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-01-09 04:55:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:53,975 INFO L225 Difference]: With dead ends: 5330 [2025-01-09 04:55:53,975 INFO L226 Difference]: Without dead ends: 2706 [2025-01-09 04:55:53,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:55:53,979 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 7663 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7663 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:53,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7663 Valid, 1373 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:55:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2025-01-09 04:55:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2025-01-09 04:55:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4672161858373922) internal successors, (3916), 2705 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3916 transitions. [2025-01-09 04:55:54,010 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3916 transitions. Word has length 123 [2025-01-09 04:55:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:54,010 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3916 transitions. [2025-01-09 04:55:54,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3916 transitions. [2025-01-09 04:55:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:55:54,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:54,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:54,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:55:54,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1522376233, now seen corresponding path program 1 times [2025-01-09 04:55:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:54,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788039265] [2025-01-09 04:55:54,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:54,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:55:54,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:55:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788039265] [2025-01-09 04:55:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788039265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:54,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:55:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465759277] [2025-01-09 04:55:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:55:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:54,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:55:54,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:55:54,643 INFO L87 Difference]: Start difference. First operand 2706 states and 3916 transitions. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:57,762 INFO L93 Difference]: Finished difference Result 4502 states and 6498 transitions. [2025-01-09 04:55:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:55:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:55:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:57,778 INFO L225 Difference]: With dead ends: 4502 [2025-01-09 04:55:57,781 INFO L226 Difference]: Without dead ends: 4198 [2025-01-09 04:55:57,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:55:57,783 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 6827 mSDsluCounter, 6998 mSDsCounter, 0 mSdLazyCounter, 7253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6827 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:57,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6827 Valid, 8408 Invalid, 7266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 7253 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 04:55:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-01-09 04:55:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 2715. [2025-01-09 04:55:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2678 states have (on average 1.4667662434652726) internal successors, (3928), 2714 states have internal predecessors, (3928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3928 transitions. [2025-01-09 04:55:57,815 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3928 transitions. Word has length 124 [2025-01-09 04:55:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:57,815 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3928 transitions. [2025-01-09 04:55:57,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3928 transitions. [2025-01-09 04:55:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:55:57,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:57,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:55:57,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:55:57,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:55:57,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash -115626613, now seen corresponding path program 1 times [2025-01-09 04:55:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743286552] [2025-01-09 04:55:57,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:55:57,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:55:57,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:57,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743286552] [2025-01-09 04:55:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743286552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9632548] [2025-01-09 04:55:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:58,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:58,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:58,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:58,261 INFO L87 Difference]: Start difference. First operand 2715 states and 3928 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:01,011 INFO L93 Difference]: Finished difference Result 4295 states and 6194 transitions. [2025-01-09 04:56:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:56:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:01,024 INFO L225 Difference]: With dead ends: 4295 [2025-01-09 04:56:01,026 INFO L226 Difference]: Without dead ends: 3706 [2025-01-09 04:56:01,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:56:01,028 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 11876 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 6648 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11876 SdHoareTripleChecker+Valid, 7861 SdHoareTripleChecker+Invalid, 6655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:01,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11876 Valid, 7861 Invalid, 6655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6648 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:56:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2025-01-09 04:56:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 2706. [2025-01-09 04:56:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.466841513675534) internal successors, (3915), 2705 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3915 transitions. [2025-01-09 04:56:01,053 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3915 transitions. Word has length 124 [2025-01-09 04:56:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:01,053 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3915 transitions. [2025-01-09 04:56:01,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3915 transitions. [2025-01-09 04:56:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:56:01,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:01,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:01,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:56:01,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:01,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1896036516, now seen corresponding path program 1 times [2025-01-09 04:56:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104281681] [2025-01-09 04:56:01,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:01,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:56:01,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:56:01,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:01,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104281681] [2025-01-09 04:56:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104281681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:01,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:01,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074475359] [2025-01-09 04:56:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:01,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:01,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:01,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:01,391 INFO L87 Difference]: Start difference. First operand 2706 states and 3915 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:03,744 INFO L93 Difference]: Finished difference Result 4208 states and 6030 transitions. [2025-01-09 04:56:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:56:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:03,751 INFO L225 Difference]: With dead ends: 4208 [2025-01-09 04:56:03,751 INFO L226 Difference]: Without dead ends: 4010 [2025-01-09 04:56:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:03,753 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 6939 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 5247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6939 SdHoareTripleChecker+Valid, 5836 SdHoareTripleChecker+Invalid, 5253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:03,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6939 Valid, 5836 Invalid, 5253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5247 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:56:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2025-01-09 04:56:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 2706. [2025-01-09 04:56:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4664668415136755) internal successors, (3914), 2705 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3914 transitions. [2025-01-09 04:56:03,778 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3914 transitions. Word has length 124 [2025-01-09 04:56:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:03,778 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3914 transitions. [2025-01-09 04:56:03,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3914 transitions. [2025-01-09 04:56:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:56:03,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:03,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:03,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:56:03,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:03,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 553304081, now seen corresponding path program 1 times [2025-01-09 04:56:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189085530] [2025-01-09 04:56:03,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:03,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:03,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:56:03,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:56:03,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:03,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189085530] [2025-01-09 04:56:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189085530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:04,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:56:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975308052] [2025-01-09 04:56:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:56:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:04,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:56:04,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:56:04,146 INFO L87 Difference]: Start difference. First operand 2706 states and 3914 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:06,515 INFO L93 Difference]: Finished difference Result 4210 states and 6033 transitions. [2025-01-09 04:56:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:56:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:06,522 INFO L225 Difference]: With dead ends: 4210 [2025-01-09 04:56:06,522 INFO L226 Difference]: Without dead ends: 4006 [2025-01-09 04:56:06,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:56:06,524 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 12548 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 6098 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12548 SdHoareTripleChecker+Valid, 6945 SdHoareTripleChecker+Invalid, 6107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 6098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:06,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12548 Valid, 6945 Invalid, 6107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 6098 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:56:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2025-01-09 04:56:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 2706. [2025-01-09 04:56:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4657174971899587) internal successors, (3912), 2705 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3912 transitions. [2025-01-09 04:56:06,556 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3912 transitions. Word has length 124 [2025-01-09 04:56:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:06,557 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3912 transitions. [2025-01-09 04:56:06,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3912 transitions. [2025-01-09 04:56:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:56:06,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:06,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:06,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:56:06,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:06,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash -744585957, now seen corresponding path program 1 times [2025-01-09 04:56:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938411516] [2025-01-09 04:56:06,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:06,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:56:06,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:56:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938411516] [2025-01-09 04:56:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938411516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:56:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277439966] [2025-01-09 04:56:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:56:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:56:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:56:06,851 INFO L87 Difference]: Start difference. First operand 2706 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:09,028 INFO L93 Difference]: Finished difference Result 4458 states and 6213 transitions. [2025-01-09 04:56:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:56:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:56:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:09,035 INFO L225 Difference]: With dead ends: 4458 [2025-01-09 04:56:09,035 INFO L226 Difference]: Without dead ends: 3370 [2025-01-09 04:56:09,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:56:09,038 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 7892 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7892 SdHoareTripleChecker+Valid, 4314 SdHoareTripleChecker+Invalid, 5580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:09,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7892 Valid, 4314 Invalid, 5580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5577 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:56:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2025-01-09 04:56:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2706. [2025-01-09 04:56:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4653428250281004) internal successors, (3911), 2705 states have internal predecessors, (3911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3911 transitions. [2025-01-09 04:56:09,070 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3911 transitions. Word has length 124 [2025-01-09 04:56:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:09,071 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3911 transitions. [2025-01-09 04:56:09,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3911 transitions. [2025-01-09 04:56:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:09,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:56:09,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 33266613, now seen corresponding path program 1 times [2025-01-09 04:56:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715582524] [2025-01-09 04:56:09,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:09,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:09,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715582524] [2025-01-09 04:56:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715582524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177665824] [2025-01-09 04:56:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:09,421 INFO L87 Difference]: Start difference. First operand 2706 states and 3911 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:11,649 INFO L93 Difference]: Finished difference Result 4381 states and 6323 transitions. [2025-01-09 04:56:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:11,657 INFO L225 Difference]: With dead ends: 4381 [2025-01-09 04:56:11,657 INFO L226 Difference]: Without dead ends: 4154 [2025-01-09 04:56:11,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:11,659 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 10644 mSDsluCounter, 4821 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10644 SdHoareTripleChecker+Valid, 6226 SdHoareTripleChecker+Invalid, 5333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:11,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10644 Valid, 6226 Invalid, 5333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:56:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2025-01-09 04:56:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2706. [2025-01-09 04:56:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.464968152866242) internal successors, (3910), 2705 states have internal predecessors, (3910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3910 transitions. [2025-01-09 04:56:11,694 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3910 transitions. Word has length 126 [2025-01-09 04:56:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:11,694 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3910 transitions. [2025-01-09 04:56:11,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3910 transitions. [2025-01-09 04:56:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:11,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:11,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:11,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:56:11,698 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:11,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2314701, now seen corresponding path program 1 times [2025-01-09 04:56:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36505161] [2025-01-09 04:56:11,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36505161] [2025-01-09 04:56:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36505161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:12,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:12,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:12,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082883643] [2025-01-09 04:56:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:12,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:12,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:12,036 INFO L87 Difference]: Start difference. First operand 2706 states and 3910 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:14,419 INFO L93 Difference]: Finished difference Result 4580 states and 6632 transitions. [2025-01-09 04:56:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:14,424 INFO L225 Difference]: With dead ends: 4580 [2025-01-09 04:56:14,424 INFO L226 Difference]: Without dead ends: 4214 [2025-01-09 04:56:14,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:14,425 INFO L435 NwaCegarLoop]: 1790 mSDtfsCounter, 12594 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 6628 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12594 SdHoareTripleChecker+Valid, 7819 SdHoareTripleChecker+Invalid, 6634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:14,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12594 Valid, 7819 Invalid, 6634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6628 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:56:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-01-09 04:56:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2025-01-09 04:56:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4645934807043837) internal successors, (3909), 2705 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3909 transitions. [2025-01-09 04:56:14,448 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3909 transitions. Word has length 126 [2025-01-09 04:56:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:14,449 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3909 transitions. [2025-01-09 04:56:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3909 transitions. [2025-01-09 04:56:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:14,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:14,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:56:14,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1033236109, now seen corresponding path program 1 times [2025-01-09 04:56:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924708860] [2025-01-09 04:56:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:14,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:14,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924708860] [2025-01-09 04:56:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924708860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797200307] [2025-01-09 04:56:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:14,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:14,713 INFO L87 Difference]: Start difference. First operand 2706 states and 3909 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:17,042 INFO L93 Difference]: Finished difference Result 4482 states and 6463 transitions. [2025-01-09 04:56:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:17,048 INFO L225 Difference]: With dead ends: 4482 [2025-01-09 04:56:17,048 INFO L226 Difference]: Without dead ends: 4178 [2025-01-09 04:56:17,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:17,054 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 6405 mSDsluCounter, 5289 mSDsCounter, 0 mSdLazyCounter, 5848 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6405 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:17,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6405 Valid, 6841 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5848 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:56:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-09 04:56:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2025-01-09 04:56:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4642188085425254) internal successors, (3908), 2705 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3908 transitions. [2025-01-09 04:56:17,116 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3908 transitions. Word has length 126 [2025-01-09 04:56:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:17,120 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3908 transitions. [2025-01-09 04:56:17,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3908 transitions. [2025-01-09 04:56:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:17,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:17,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:17,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:56:17,123 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1854981567, now seen corresponding path program 1 times [2025-01-09 04:56:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742693260] [2025-01-09 04:56:17,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:17,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:17,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:17,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:17,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742693260] [2025-01-09 04:56:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742693260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:17,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:17,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44001862] [2025-01-09 04:56:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:17,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:17,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:17,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:17,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:17,515 INFO L87 Difference]: Start difference. First operand 2706 states and 3908 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:20,217 INFO L93 Difference]: Finished difference Result 4618 states and 6670 transitions. [2025-01-09 04:56:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:20,223 INFO L225 Difference]: With dead ends: 4618 [2025-01-09 04:56:20,224 INFO L226 Difference]: Without dead ends: 4214 [2025-01-09 04:56:20,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:20,226 INFO L435 NwaCegarLoop]: 1787 mSDtfsCounter, 9214 mSDsluCounter, 6017 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9214 SdHoareTripleChecker+Valid, 7804 SdHoareTripleChecker+Invalid, 6627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9214 Valid, 7804 Invalid, 6627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6622 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:56:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-01-09 04:56:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2025-01-09 04:56:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.463844136380667) internal successors, (3907), 2705 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3907 transitions. [2025-01-09 04:56:20,260 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3907 transitions. Word has length 126 [2025-01-09 04:56:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:20,260 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3907 transitions. [2025-01-09 04:56:20,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3907 transitions. [2025-01-09 04:56:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:20,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:20,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:20,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:56:20,263 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2018426482, now seen corresponding path program 1 times [2025-01-09 04:56:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:20,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671711404] [2025-01-09 04:56:20,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:20,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:20,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671711404] [2025-01-09 04:56:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671711404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848648484] [2025-01-09 04:56:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:20,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:20,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:20,559 INFO L87 Difference]: Start difference. First operand 2706 states and 3907 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:23,371 INFO L93 Difference]: Finished difference Result 4459 states and 6438 transitions. [2025-01-09 04:56:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:23,375 INFO L225 Difference]: With dead ends: 4459 [2025-01-09 04:56:23,375 INFO L226 Difference]: Without dead ends: 4178 [2025-01-09 04:56:23,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:23,377 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 12882 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 6393 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12882 SdHoareTripleChecker+Valid, 7524 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:23,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12882 Valid, 7524 Invalid, 6400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6393 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 04:56:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-09 04:56:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2025-01-09 04:56:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4634694642188086) internal successors, (3906), 2705 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3906 transitions. [2025-01-09 04:56:23,407 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3906 transitions. Word has length 126 [2025-01-09 04:56:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3906 transitions. [2025-01-09 04:56:23,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3906 transitions. [2025-01-09 04:56:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:23,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:23,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:23,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:56:23,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:23,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1182584093, now seen corresponding path program 1 times [2025-01-09 04:56:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314577029] [2025-01-09 04:56:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:23,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:23,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:23,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:23,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314577029] [2025-01-09 04:56:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314577029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:23,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434336707] [2025-01-09 04:56:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:23,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:23,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:23,672 INFO L87 Difference]: Start difference. First operand 2706 states and 3906 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:26,230 INFO L93 Difference]: Finished difference Result 4794 states and 6926 transitions. [2025-01-09 04:56:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:26,235 INFO L225 Difference]: With dead ends: 4794 [2025-01-09 04:56:26,235 INFO L226 Difference]: Without dead ends: 4214 [2025-01-09 04:56:26,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:56:26,237 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 11198 mSDsluCounter, 5871 mSDsCounter, 0 mSdLazyCounter, 6374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11198 SdHoareTripleChecker+Valid, 7607 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:26,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11198 Valid, 7607 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6374 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:56:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-01-09 04:56:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2025-01-09 04:56:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4627201198950919) internal successors, (3904), 2705 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3904 transitions. [2025-01-09 04:56:26,269 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3904 transitions. Word has length 126 [2025-01-09 04:56:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:26,270 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3904 transitions. [2025-01-09 04:56:26,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3904 transitions. [2025-01-09 04:56:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:26,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:26,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:26,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:56:26,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -829302792, now seen corresponding path program 1 times [2025-01-09 04:56:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573467187] [2025-01-09 04:56:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:26,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:26,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573467187] [2025-01-09 04:56:26,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573467187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:26,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:26,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:26,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533590030] [2025-01-09 04:56:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:26,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:26,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:26,643 INFO L87 Difference]: Start difference. First operand 2706 states and 3904 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:29,279 INFO L93 Difference]: Finished difference Result 4432 states and 6386 transitions. [2025-01-09 04:56:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:29,284 INFO L225 Difference]: With dead ends: 4432 [2025-01-09 04:56:29,284 INFO L226 Difference]: Without dead ends: 4154 [2025-01-09 04:56:29,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:29,286 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 11377 mSDsluCounter, 5319 mSDsCounter, 0 mSdLazyCounter, 5848 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11377 SdHoareTripleChecker+Valid, 6890 SdHoareTripleChecker+Invalid, 5855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:29,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11377 Valid, 6890 Invalid, 5855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5848 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:56:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2025-01-09 04:56:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2706. [2025-01-09 04:56:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4619707755713751) internal successors, (3902), 2705 states have internal predecessors, (3902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3902 transitions. [2025-01-09 04:56:29,317 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3902 transitions. Word has length 126 [2025-01-09 04:56:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:29,318 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3902 transitions. [2025-01-09 04:56:29,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3902 transitions. [2025-01-09 04:56:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:29,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:29,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:56:29,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 987279281, now seen corresponding path program 1 times [2025-01-09 04:56:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066853513] [2025-01-09 04:56:29,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:29,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:29,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:29,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066853513] [2025-01-09 04:56:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066853513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:29,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:56:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014551489] [2025-01-09 04:56:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:29,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:56:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:56:29,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:56:29,640 INFO L87 Difference]: Start difference. First operand 2706 states and 3902 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:32,362 INFO L93 Difference]: Finished difference Result 4474 states and 6415 transitions. [2025-01-09 04:56:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:56:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:32,367 INFO L225 Difference]: With dead ends: 4474 [2025-01-09 04:56:32,367 INFO L226 Difference]: Without dead ends: 4240 [2025-01-09 04:56:32,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:56:32,370 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 12972 mSDsluCounter, 7791 mSDsCounter, 0 mSdLazyCounter, 8307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12972 SdHoareTripleChecker+Valid, 9245 SdHoareTripleChecker+Invalid, 8319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 8307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:32,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12972 Valid, 9245 Invalid, 8319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 8307 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:56:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2025-01-09 04:56:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 2740. [2025-01-09 04:56:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2703 states have (on average 1.462819089900111) internal successors, (3954), 2739 states have internal predecessors, (3954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3954 transitions. [2025-01-09 04:56:32,404 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3954 transitions. Word has length 126 [2025-01-09 04:56:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 2740 states and 3954 transitions. [2025-01-09 04:56:32,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3954 transitions. [2025-01-09 04:56:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:56:32,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:32,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:32,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:56:32,408 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:32,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash -310610757, now seen corresponding path program 1 times [2025-01-09 04:56:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133487428] [2025-01-09 04:56:32,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:32,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:56:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:56:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:32,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133487428] [2025-01-09 04:56:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133487428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296986330] [2025-01-09 04:56:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:32,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:32,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:32,762 INFO L87 Difference]: Start difference. First operand 2740 states and 3954 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,879 INFO L93 Difference]: Finished difference Result 3902 states and 5623 transitions. [2025-01-09 04:56:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:56:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,882 INFO L225 Difference]: With dead ends: 3902 [2025-01-09 04:56:34,882 INFO L226 Difference]: Without dead ends: 2804 [2025-01-09 04:56:34,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:56:34,885 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 6854 mSDsluCounter, 4898 mSDsCounter, 0 mSdLazyCounter, 5320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6854 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 5327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6854 Valid, 6316 Invalid, 5327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:56:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2025-01-09 04:56:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2706. [2025-01-09 04:56:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4612214312476584) internal successors, (3900), 2705 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3900 transitions. [2025-01-09 04:56:34,910 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3900 transitions. Word has length 126 [2025-01-09 04:56:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3900 transitions. [2025-01-09 04:56:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3900 transitions. [2025-01-09 04:56:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:34,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:34,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:56:34,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:34,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash 681403934, now seen corresponding path program 1 times [2025-01-09 04:56:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977901024] [2025-01-09 04:56:34,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:34,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:34,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977901024] [2025-01-09 04:56:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977901024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642894838] [2025-01-09 04:56:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:35,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:35,227 INFO L87 Difference]: Start difference. First operand 2706 states and 3900 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:38,093 INFO L93 Difference]: Finished difference Result 4444 states and 6412 transitions. [2025-01-09 04:56:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:56:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:38,097 INFO L225 Difference]: With dead ends: 4444 [2025-01-09 04:56:38,098 INFO L226 Difference]: Without dead ends: 4178 [2025-01-09 04:56:38,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:56:38,099 INFO L435 NwaCegarLoop]: 1881 mSDtfsCounter, 5774 mSDsluCounter, 6279 mSDsCounter, 0 mSdLazyCounter, 6958 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5774 SdHoareTripleChecker+Valid, 8160 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:38,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5774 Valid, 8160 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6958 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:56:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-09 04:56:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2025-01-09 04:56:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4608467590857999) internal successors, (3899), 2705 states have internal predecessors, (3899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3899 transitions. [2025-01-09 04:56:38,124 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3899 transitions. Word has length 128 [2025-01-09 04:56:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:38,124 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3899 transitions. [2025-01-09 04:56:38,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3899 transitions. [2025-01-09 04:56:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:38,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:38,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:56:38,128 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:38,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1420830732, now seen corresponding path program 1 times [2025-01-09 04:56:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:38,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804944917] [2025-01-09 04:56:38,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:38,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804944917] [2025-01-09 04:56:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804944917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828111301] [2025-01-09 04:56:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:38,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:38,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:38,406 INFO L87 Difference]: Start difference. First operand 2706 states and 3899 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:41,297 INFO L93 Difference]: Finished difference Result 4374 states and 6298 transitions. [2025-01-09 04:56:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:56:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:41,302 INFO L225 Difference]: With dead ends: 4374 [2025-01-09 04:56:41,303 INFO L226 Difference]: Without dead ends: 4154 [2025-01-09 04:56:41,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:56:41,305 INFO L435 NwaCegarLoop]: 1647 mSDtfsCounter, 11397 mSDsluCounter, 7049 mSDsCounter, 0 mSdLazyCounter, 7293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11397 SdHoareTripleChecker+Valid, 8696 SdHoareTripleChecker+Invalid, 7300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:41,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11397 Valid, 8696 Invalid, 7300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7293 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:56:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2025-01-09 04:56:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2706. [2025-01-09 04:56:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4604720869239416) internal successors, (3898), 2705 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3898 transitions. [2025-01-09 04:56:41,339 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3898 transitions. Word has length 128 [2025-01-09 04:56:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:41,340 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3898 transitions. [2025-01-09 04:56:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3898 transitions. [2025-01-09 04:56:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:41,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:41,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:56:41,343 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:41,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1667384390, now seen corresponding path program 1 times [2025-01-09 04:56:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58323913] [2025-01-09 04:56:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:41,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:41,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58323913] [2025-01-09 04:56:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58323913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948403618] [2025-01-09 04:56:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:41,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:41,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:41,561 INFO L87 Difference]: Start difference. First operand 2706 states and 3898 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:44,048 INFO L93 Difference]: Finished difference Result 4459 states and 6427 transitions. [2025-01-09 04:56:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:56:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:44,053 INFO L225 Difference]: With dead ends: 4459 [2025-01-09 04:56:44,053 INFO L226 Difference]: Without dead ends: 4178 [2025-01-09 04:56:44,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:44,054 INFO L435 NwaCegarLoop]: 1937 mSDtfsCounter, 8624 mSDsluCounter, 6442 mSDsCounter, 0 mSdLazyCounter, 7174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8624 SdHoareTripleChecker+Valid, 8379 SdHoareTripleChecker+Invalid, 7180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:44,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8624 Valid, 8379 Invalid, 7180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7174 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:56:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-09 04:56:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2025-01-09 04:56:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.460097414762083) internal successors, (3897), 2705 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3897 transitions. [2025-01-09 04:56:44,078 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3897 transitions. Word has length 128 [2025-01-09 04:56:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:44,078 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3897 transitions. [2025-01-09 04:56:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3897 transitions. [2025-01-09 04:56:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:44,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:44,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:44,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:56:44,081 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:44,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash -931556890, now seen corresponding path program 1 times [2025-01-09 04:56:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648626944] [2025-01-09 04:56:44,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:44,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:44,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648626944] [2025-01-09 04:56:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648626944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609081387] [2025-01-09 04:56:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:44,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:44,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:44,298 INFO L87 Difference]: Start difference. First operand 2706 states and 3897 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:46,501 INFO L93 Difference]: Finished difference Result 4026 states and 5690 transitions. [2025-01-09 04:56:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:46,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:56:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:46,506 INFO L225 Difference]: With dead ends: 4026 [2025-01-09 04:56:46,506 INFO L226 Difference]: Without dead ends: 3838 [2025-01-09 04:56:46,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:46,508 INFO L435 NwaCegarLoop]: 1302 mSDtfsCounter, 7209 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 5159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7209 SdHoareTripleChecker+Valid, 5336 SdHoareTripleChecker+Invalid, 5165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7209 Valid, 5336 Invalid, 5165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5159 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 04:56:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2025-01-09 04:56:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 2706. [2025-01-09 04:56:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4597227426002248) internal successors, (3896), 2705 states have internal predecessors, (3896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3896 transitions. [2025-01-09 04:56:46,537 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3896 transitions. Word has length 128 [2025-01-09 04:56:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:46,538 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3896 transitions. [2025-01-09 04:56:46,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3896 transitions. [2025-01-09 04:56:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:46,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:46,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:46,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:56:46,541 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:46,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1604231275, now seen corresponding path program 1 times [2025-01-09 04:56:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:46,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70488095] [2025-01-09 04:56:46,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:46,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70488095] [2025-01-09 04:56:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70488095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529392484] [2025-01-09 04:56:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:46,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:46,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:46,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:46,855 INFO L87 Difference]: Start difference. First operand 2706 states and 3896 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:49,353 INFO L93 Difference]: Finished difference Result 4389 states and 6313 transitions. [2025-01-09 04:56:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:56:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:56:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:49,358 INFO L225 Difference]: With dead ends: 4389 [2025-01-09 04:56:49,358 INFO L226 Difference]: Without dead ends: 4154 [2025-01-09 04:56:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:56:49,359 INFO L435 NwaCegarLoop]: 1716 mSDtfsCounter, 11183 mSDsluCounter, 5756 mSDsCounter, 0 mSdLazyCounter, 6319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11183 SdHoareTripleChecker+Valid, 7472 SdHoareTripleChecker+Invalid, 6326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:49,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11183 Valid, 7472 Invalid, 6326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:56:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2025-01-09 04:56:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2706. [2025-01-09 04:56:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4593480704383663) internal successors, (3895), 2705 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3895 transitions. [2025-01-09 04:56:49,383 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3895 transitions. Word has length 128 [2025-01-09 04:56:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3895 transitions. [2025-01-09 04:56:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3895 transitions. [2025-01-09 04:56:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:56:49,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:49,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:56:49,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:56:49,385 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 04:56:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -943249158, now seen corresponding path program 1 times [2025-01-09 04:56:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826918421] [2025-01-09 04:56:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:56:49,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:56:49,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:49,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826918421] [2025-01-09 04:56:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826918421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:56:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036633666] [2025-01-09 04:56:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:56:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:49,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:56:49,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:56:49,646 INFO L87 Difference]: Start difference. First operand 2706 states and 3895 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)