./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8e58e4dd7f21a353342bc0a492b99ed688619f4c3decc3151bb6acbb6daeee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:16:48,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:16:48,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:16:48,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:16:48,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:16:49,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:16:49,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:16:49,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:16:49,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:16:49,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:16:49,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:16:49,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:16:49,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:16:49,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:16:49,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:16:49,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:16:49,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:16:49,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:16:49,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:16:49,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:16:49,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:16:49,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:16:49,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:49,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:16:49,021 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8e58e4dd7f21a353342bc0a492b99ed688619f4c3decc3151bb6acbb6daeee1 [2025-03-03 15:16:49,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:16:49,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:16:49,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:16:49,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:16:49,256 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:16:49,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:50,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3869f40a/be21a89c67e04d5d996ddbcdd2a64e38/FLAGdc3cee551 [2025-03-03 15:16:50,889 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:16:50,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:50,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3869f40a/be21a89c67e04d5d996ddbcdd2a64e38/FLAGdc3cee551 [2025-03-03 15:16:50,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3869f40a/be21a89c67e04d5d996ddbcdd2a64e38 [2025-03-03 15:16:50,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:16:50,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:16:50,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:50,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:16:50,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:16:50,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:50" (1/1) ... [2025-03-03 15:16:50,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e97e282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:50, skipping insertion in model container [2025-03-03 15:16:50,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:50" (1/1) ... [2025-03-03 15:16:51,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:16:51,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2025-03-03 15:16:51,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2025-03-03 15:16:51,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2025-03-03 15:16:51,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2025-03-03 15:16:51,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2025-03-03 15:16:51,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2025-03-03 15:16:51,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2025-03-03 15:16:51,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2025-03-03 15:16:51,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2025-03-03 15:16:51,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2025-03-03 15:16:51,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2025-03-03 15:16:51,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2025-03-03 15:16:51,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2025-03-03 15:16:51,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2025-03-03 15:16:51,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2025-03-03 15:16:51,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2025-03-03 15:16:51,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2025-03-03 15:16:51,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2025-03-03 15:16:51,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2025-03-03 15:16:51,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2025-03-03 15:16:51,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2025-03-03 15:16:51,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2025-03-03 15:16:51,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:51,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:16:52,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2025-03-03 15:16:52,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2025-03-03 15:16:52,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2025-03-03 15:16:52,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2025-03-03 15:16:52,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2025-03-03 15:16:52,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2025-03-03 15:16:52,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2025-03-03 15:16:52,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2025-03-03 15:16:52,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2025-03-03 15:16:52,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2025-03-03 15:16:52,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2025-03-03 15:16:52,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2025-03-03 15:16:52,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2025-03-03 15:16:52,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2025-03-03 15:16:52,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2025-03-03 15:16:52,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2025-03-03 15:16:52,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2025-03-03 15:16:52,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2025-03-03 15:16:52,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2025-03-03 15:16:52,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2025-03-03 15:16:52,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2025-03-03 15:16:52,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2025-03-03 15:16:52,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:52,438 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:16:52,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52 WrapperNode [2025-03-03 15:16:52,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:52,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:52,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:16:52,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:16:52,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,642 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13233 [2025-03-03 15:16:52,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:52,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:16:52,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:16:52,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:16:52,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,782 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-03-03 15:16:52,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:16:52,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:16:52,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:16:52,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:16:52,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (1/1) ... [2025-03-03 15:16:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:52,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:16:52,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:16:52,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:16:52,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:16:52,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:16:52,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:16:53,307 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:16:53,308 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:16:57,602 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11864: havoc main_~node6__m6~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3409: havoc main_~node6__m6~13#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~9#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2088: havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11081: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8967: havoc main_~check__tmp~35#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9760: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~42#1; [2025-03-03 15:16:57,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13466: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~59#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~58#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8446: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~27#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16904: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~75#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14265: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~63#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20609: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19024: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1;havoc main_~node6__m6~85#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10570: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6343: havoc main_~node6__m6~26#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7667: havoc main_~check__tmp~28#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~27#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8463: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~30#1; [2025-03-03 15:16:57,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20096: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~75#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5828: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~17#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16400: havoc main_~check__tmp~76#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~75#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17727: havoc main_~check__tmp~84#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~83#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3722: havoc main_~node6__m6~14#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8480: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~36#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5046: havoc main_~check__tmp~16#1;havoc main_~node6__m6~20#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~15#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15088: havoc main_~check__tmp~68#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~67#1; [2025-03-03 15:16:57,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21432: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~96#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12976: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~57#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7163: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~25#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12185: havoc main_~check__tmp~52#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20113: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~90#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5845: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~18#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18799: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~63#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10875: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9292: havoc main_~check__tmp~37#1;havoc main_~node6__m6~40#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~36#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16163: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~51#1; [2025-03-03 15:16:57,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7180: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~30#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5862: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13790: havoc main_~node6__m6~61#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~60#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20925: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19340: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~72#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4542: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~15#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~9#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18816: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~70#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21460: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16180: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~54#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:16:57,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7992: havoc main_~check__tmp~30#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~29#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5879: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~24#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4559: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~18#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6676: havoc main_~node6__m6~28#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~10#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~5#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18040: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1;havoc main_~node6__m6~80#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18833: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~84#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15401: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~70#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~69#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16197: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~60#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10385: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~45#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-03 15:16:57,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12501: havoc main_~node6__m6~55#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~53#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21488: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5371: havoc main_~check__tmp~18#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~18#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~17#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11713: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~51#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~12#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~6#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4055: havoc main_~node6__m6~16#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734: havoc main_~node6__m6~10#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9605: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17533: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~65#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21234: havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1;havoc main_~node6__m6~95#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-03-03 15:16:57,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16214: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~72#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14894: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~55#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19661: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1428: havoc main_~node6__m6~4#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16756: havoc main_~check__tmp~78#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~77#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17550: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~78#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14117: havoc main_~check__tmp~62#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~61#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21516: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14911: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~66#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8305: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node6__m6~35#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-03-03 15:16:57,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20735: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~93#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21267: havoc main_~node2__m2~66#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18361: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~39#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15722: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~72#1;havoc main_~node6__m6~70#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~71#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13608: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~45#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11232: havoc main_~node6__m6~49#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5684: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21544: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7012: havoc main_~check__tmp~25#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12828: havoc main_~check__tmp~55#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~54#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19967: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13625: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~50#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7815: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~33#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1738: havoc main_~node6__m6~5#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21299: havoc main_~node3__m3~68#1; [2025-03-03 15:16:57,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9937: havoc main_~check__tmp~41#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~36#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4391: havoc main_~check__tmp~13#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: havoc main_~check__tmp~8#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~9#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13642: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~60#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21572: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17081: havoc main_~check__tmp~80#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~63#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~79#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18667: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8628: havoc main_~node6__m6~37#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14442: havoc main_~check__tmp~64#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~63#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16028: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~74#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~73#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5194: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~21#1; [2025-03-03 15:16:57,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11013: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~33#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11543: havoc main_~node6__m6~50#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12336: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~45#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6525: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~27#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19476: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~87#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21331: havoc main_~node4__m4~72#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328: havoc main_~node6__m6~31#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11030: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~34#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12353: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~54#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3904: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~15#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13153: havoc main_~check__tmp~57#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~56#1; [2025-03-03 15:16:57,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2583: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~9#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18176: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~81#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10250: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15537: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~69#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11047: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~36#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4707: havoc main_~node6__m6~19#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6030: havoc main_~node6__m6~25#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1274: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~3#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17394: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~82#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~81#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14755: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~66#1;havoc main_~node6__m6~65#1;havoc main_~node5__m5~54#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~65#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21363: havoc main_~node5__m5~80#1; [2025-03-03 15:16:57,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20309: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-03-03 15:16:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11064: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~40#1; [2025-03-03 15:16:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9743: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~35#1; [2025-03-03 15:16:58,127 INFO L? ?]: Removed 2736 outVars from TransFormulas that were not future-live. [2025-03-03 15:16:58,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:16:58,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:16:58,172 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:16:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:58 BoogieIcfgContainer [2025-03-03 15:16:58,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:16:58,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:16:58,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:16:58,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:16:58,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:16:50" (1/3) ... [2025-03-03 15:16:58,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b7090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:58, skipping insertion in model container [2025-03-03 15:16:58,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:52" (2/3) ... [2025-03-03 15:16:58,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b7090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:58, skipping insertion in model container [2025-03-03 15:16:58,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:58" (3/3) ... [2025-03-03 15:16:58,182 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:58,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:16:58,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c that has 1 procedures, 2541 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-03 15:16:58,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:16:58,315 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;@2260cb7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:16:58,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-03 15:16:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:16:58,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:58,346 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] [2025-03-03 15:16:58,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 755284470, now seen corresponding path program 1 times [2025-03-03 15:16:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729250359] [2025-03-03 15:16:58,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:58,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:16:58,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:16:58,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:58,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729250359] [2025-03-03 15:16:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729250359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:59,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433331344] [2025-03-03 15:16:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:59,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:59,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:59,023 INFO L87 Difference]: Start difference. First operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 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 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:00,253 INFO L93 Difference]: Finished difference Result 2886 states and 4965 transitions. [2025-03-03 15:17:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-03-03 15:17:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:00,274 INFO L225 Difference]: With dead ends: 2886 [2025-03-03 15:17:00,274 INFO L226 Difference]: Without dead ends: 1634 [2025-03-03 15:17:00,281 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-03-03 15:17:00,285 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 8216 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8216 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:00,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8216 Valid, 1638 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:17:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-03 15:17:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-03 15:17:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1612 states have (on average 1.2890818858560793) internal successors, (2078), 1633 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2078 transitions. [2025-03-03 15:17:00,377 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2078 transitions. Word has length 87 [2025-03-03 15:17:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2078 transitions. [2025-03-03 15:17:00,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2078 transitions. [2025-03-03 15:17:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:17:00,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:00,383 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] [2025-03-03 15:17:00,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:17:00,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:00,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash 616392988, now seen corresponding path program 1 times [2025-03-03 15:17:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:00,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501365069] [2025-03-03 15:17:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:00,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:17:00,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:17:00,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501365069] [2025-03-03 15:17:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501365069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840859487] [2025-03-03 15:17:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:00,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:00,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:00,605 INFO L87 Difference]: Start difference. First operand 1634 states and 2078 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:01,330 INFO L93 Difference]: Finished difference Result 2209 states and 2832 transitions. [2025-03-03 15:17:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:01,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-03-03 15:17:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:01,338 INFO L225 Difference]: With dead ends: 2209 [2025-03-03 15:17:01,338 INFO L226 Difference]: Without dead ends: 1377 [2025-03-03 15:17:01,340 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-03-03 15:17:01,342 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 5278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5278 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:01,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5278 Valid, 898 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-03 15:17:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2025-03-03 15:17:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1355 states have (on average 1.3136531365313653) internal successors, (1780), 1376 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1780 transitions. [2025-03-03 15:17:01,375 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1780 transitions. Word has length 87 [2025-03-03 15:17:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:01,376 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1780 transitions. [2025-03-03 15:17:01,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1780 transitions. [2025-03-03 15:17:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:17:01,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:01,380 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] [2025-03-03 15:17:01,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:17:01,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1830642302, now seen corresponding path program 1 times [2025-03-03 15:17:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217050061] [2025-03-03 15:17:01,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:01,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:17:01,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:17:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:01,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217050061] [2025-03-03 15:17:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217050061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028661108] [2025-03-03 15:17:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:01,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:01,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:01,568 INFO L87 Difference]: Start difference. First operand 1377 states and 1780 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:02,319 INFO L93 Difference]: Finished difference Result 2001 states and 2602 transitions. [2025-03-03 15:17:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-03-03 15:17:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:02,323 INFO L225 Difference]: With dead ends: 2001 [2025-03-03 15:17:02,323 INFO L226 Difference]: Without dead ends: 1313 [2025-03-03 15:17:02,324 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-03-03 15:17:02,327 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 4983 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4983 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:02,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4983 Valid, 816 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-03-03 15:17:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2025-03-03 15:17:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1291 states have (on average 1.322230828814872) internal successors, (1707), 1312 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1707 transitions. [2025-03-03 15:17:02,350 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1707 transitions. Word has length 87 [2025-03-03 15:17:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:02,351 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1707 transitions. [2025-03-03 15:17:02,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1707 transitions. [2025-03-03 15:17:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:17:02,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:02,353 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] [2025-03-03 15:17:02,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:17:02,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash 164884638, now seen corresponding path program 1 times [2025-03-03 15:17:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:02,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142763] [2025-03-03 15:17:02,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:02,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:17:02,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:17:02,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142763] [2025-03-03 15:17:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:02,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036752668] [2025-03-03 15:17:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:02,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:02,519 INFO L87 Difference]: Start difference. First operand 1313 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:02,952 INFO L93 Difference]: Finished difference Result 1745 states and 2264 transitions. [2025-03-03 15:17:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2025-03-03 15:17:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:02,956 INFO L225 Difference]: With dead ends: 1745 [2025-03-03 15:17:02,956 INFO L226 Difference]: Without dead ends: 1077 [2025-03-03 15:17:02,957 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-03-03 15:17:02,959 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 4135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4135 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:02,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4135 Valid, 746 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:17:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-03 15:17:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2025-03-03 15:17:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1055 states have (on average 1.3327014218009479) internal successors, (1406), 1076 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1406 transitions. [2025-03-03 15:17:02,975 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1406 transitions. Word has length 89 [2025-03-03 15:17:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:02,975 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1406 transitions. [2025-03-03 15:17:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1406 transitions. [2025-03-03 15:17:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:17:02,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:02,981 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] [2025-03-03 15:17:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:17:02,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1506905864, now seen corresponding path program 1 times [2025-03-03 15:17:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:02,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105190843] [2025-03-03 15:17:02,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:03,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:17:03,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:17:03,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:03,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105190843] [2025-03-03 15:17:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105190843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839999743] [2025-03-03 15:17:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:03,160 INFO L87 Difference]: Start difference. First operand 1077 states and 1406 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:03,471 INFO L93 Difference]: Finished difference Result 1267 states and 1624 transitions. [2025-03-03 15:17:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-03-03 15:17:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:03,474 INFO L225 Difference]: With dead ends: 1267 [2025-03-03 15:17:03,474 INFO L226 Difference]: Without dead ends: 749 [2025-03-03 15:17:03,474 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-03-03 15:17:03,475 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2806 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2806 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:03,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2806 Valid, 556 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:17:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-03 15:17:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-03 15:17:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 727 states have (on average 1.3383768913342504) internal successors, (973), 748 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 973 transitions. [2025-03-03 15:17:03,484 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 973 transitions. Word has length 91 [2025-03-03 15:17:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:03,485 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 973 transitions. [2025-03-03 15:17:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 973 transitions. [2025-03-03 15:17:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:17:03,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:03,486 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] [2025-03-03 15:17:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:17:03,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:03,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1734660308, now seen corresponding path program 1 times [2025-03-03 15:17:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616663192] [2025-03-03 15:17:03,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:03,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:17:03,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:17:03,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:03,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-03-03 15:17:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616663192] [2025-03-03 15:17:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616663192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339154933] [2025-03-03 15:17:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:03,646 INFO L87 Difference]: Start difference. First operand 749 states and 973 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:03,917 INFO L93 Difference]: Finished difference Result 1109 states and 1444 transitions. [2025-03-03 15:17:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2025-03-03 15:17:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:03,919 INFO L225 Difference]: With dead ends: 1109 [2025-03-03 15:17:03,919 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 15:17:03,920 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-03-03 15:17:03,920 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2678 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2678 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:03,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2678 Valid, 550 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 15:17:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-03 15:17:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3455882352941178) internal successors, (915), 701 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 915 transitions. [2025-03-03 15:17:03,929 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 915 transitions. Word has length 93 [2025-03-03 15:17:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:03,930 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 915 transitions. [2025-03-03 15:17:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 915 transitions. [2025-03-03 15:17:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:03,931 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] [2025-03-03 15:17:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:17:03,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1907477939, now seen corresponding path program 1 times [2025-03-03 15:17:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124556176] [2025-03-03 15:17:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:03,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:03,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:04,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124556176] [2025-03-03 15:17:04,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124556176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:04,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:17:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106253243] [2025-03-03 15:17:04,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:04,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:17:04,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:04,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:17:04,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:17:04,368 INFO L87 Difference]: Start difference. First operand 702 states and 915 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:05,385 INFO L93 Difference]: Finished difference Result 1321 states and 1729 transitions. [2025-03-03 15:17:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 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 95 [2025-03-03 15:17:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:05,388 INFO L225 Difference]: With dead ends: 1321 [2025-03-03 15:17:05,388 INFO L226 Difference]: Without dead ends: 1082 [2025-03-03 15:17:05,388 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-03-03 15:17:05,389 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 3825 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:05,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 2858 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-03 15:17:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 702. [2025-03-03 15:17:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3441176470588236) internal successors, (914), 701 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 914 transitions. [2025-03-03 15:17:05,401 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 914 transitions. Word has length 95 [2025-03-03 15:17:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:05,401 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 914 transitions. [2025-03-03 15:17:05,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 914 transitions. [2025-03-03 15:17:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:05,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:05,404 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] [2025-03-03 15:17:05,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:17:05,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:05,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -926750067, now seen corresponding path program 1 times [2025-03-03 15:17:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105853930] [2025-03-03 15:17:05,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:05,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:05,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:05,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105853930] [2025-03-03 15:17:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105853930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:05,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:17:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542868298] [2025-03-03 15:17:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:05,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:17:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:05,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:17:05,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:17:05,801 INFO L87 Difference]: Start difference. First operand 702 states and 914 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:06,639 INFO L93 Difference]: Finished difference Result 1330 states and 1686 transitions. [2025-03-03 15:17:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:17:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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 95 [2025-03-03 15:17:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:06,641 INFO L225 Difference]: With dead ends: 1330 [2025-03-03 15:17:06,641 INFO L226 Difference]: Without dead ends: 951 [2025-03-03 15:17:06,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:17:06,642 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 3727 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3727 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:06,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3727 Valid, 2014 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-03 15:17:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 702. [2025-03-03 15:17:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3426470588235293) internal successors, (913), 701 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 913 transitions. [2025-03-03 15:17:06,652 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 913 transitions. Word has length 95 [2025-03-03 15:17:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:06,652 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 913 transitions. [2025-03-03 15:17:06,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 913 transitions. [2025-03-03 15:17:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:06,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:06,655 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] [2025-03-03 15:17:06,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:17:06,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200469, now seen corresponding path program 1 times [2025-03-03 15:17:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287880528] [2025-03-03 15:17:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:06,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:06,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:06,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:06,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:06,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:06,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287880528] [2025-03-03 15:17:06,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287880528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:06,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:06,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252597387] [2025-03-03 15:17:06,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:06,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:06,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:06,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:06,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:06,944 INFO L87 Difference]: Start difference. First operand 702 states and 913 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:07,909 INFO L93 Difference]: Finished difference Result 1293 states and 1701 transitions. [2025-03-03 15:17:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2025-03-03 15:17:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:07,912 INFO L225 Difference]: With dead ends: 1293 [2025-03-03 15:17:07,912 INFO L226 Difference]: Without dead ends: 1084 [2025-03-03 15:17:07,913 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-03-03 15:17:07,913 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1972 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 3301 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-03 15:17:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 702. [2025-03-03 15:17:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3411764705882352) internal successors, (912), 701 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 912 transitions. [2025-03-03 15:17:07,924 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 912 transitions. Word has length 95 [2025-03-03 15:17:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 912 transitions. [2025-03-03 15:17:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 912 transitions. [2025-03-03 15:17:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:07,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:07,925 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] [2025-03-03 15:17:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:17:07,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1978500275, now seen corresponding path program 1 times [2025-03-03 15:17:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860900195] [2025-03-03 15:17:07,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:07,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:07,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:07,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:07,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860900195] [2025-03-03 15:17:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860900195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178261872] [2025-03-03 15:17:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:08,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:08,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:08,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:08,277 INFO L87 Difference]: Start difference. First operand 702 states and 912 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:09,216 INFO L93 Difference]: Finished difference Result 1212 states and 1597 transitions. [2025-03-03 15:17:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2025-03-03 15:17:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:09,218 INFO L225 Difference]: With dead ends: 1212 [2025-03-03 15:17:09,218 INFO L226 Difference]: Without dead ends: 1079 [2025-03-03 15:17:09,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:09,219 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 4010 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4010 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:09,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4010 Valid, 3309 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-03-03 15:17:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 702. [2025-03-03 15:17:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.339705882352941) internal successors, (911), 701 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 911 transitions. [2025-03-03 15:17:09,227 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 911 transitions. Word has length 95 [2025-03-03 15:17:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 911 transitions. [2025-03-03 15:17:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 911 transitions. [2025-03-03 15:17:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:17:09,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:09,228 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] [2025-03-03 15:17:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:17:09,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1003472147, now seen corresponding path program 1 times [2025-03-03 15:17:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613496970] [2025-03-03 15:17:09,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:17:09,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:17:09,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:09,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613496970] [2025-03-03 15:17:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613496970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:09,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931930589] [2025-03-03 15:17:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:09,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:09,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:09,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:09,473 INFO L87 Difference]: Start difference. First operand 702 states and 911 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:10,268 INFO L93 Difference]: Finished difference Result 1171 states and 1534 transitions. [2025-03-03 15:17:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2025-03-03 15:17:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:10,270 INFO L225 Difference]: With dead ends: 1171 [2025-03-03 15:17:10,271 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 15:17:10,271 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-03-03 15:17:10,271 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 3546 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3546 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:10,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3546 Valid, 2498 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 15:17:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2025-03-03 15:17:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.338235294117647) internal successors, (910), 701 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 910 transitions. [2025-03-03 15:17:10,280 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 910 transitions. Word has length 96 [2025-03-03 15:17:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 910 transitions. [2025-03-03 15:17:10,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 910 transitions. [2025-03-03 15:17:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:10,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:10,281 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] [2025-03-03 15:17:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:17:10,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:10,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1801007994, now seen corresponding path program 1 times [2025-03-03 15:17:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509861509] [2025-03-03 15:17:10,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:10,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:10,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-03-03 15:17:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509861509] [2025-03-03 15:17:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509861509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:10,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771881231] [2025-03-03 15:17:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:10,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:10,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:10,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:10,508 INFO L87 Difference]: Start difference. First operand 702 states and 910 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:11,261 INFO L93 Difference]: Finished difference Result 1075 states and 1382 transitions. [2025-03-03 15:17:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:11,263 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 15:17:11,263 INFO L226 Difference]: Without dead ends: 1056 [2025-03-03 15:17:11,264 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-03-03 15:17:11,264 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 2372 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:11,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 2328 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-03 15:17:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 702. [2025-03-03 15:17:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3367647058823529) internal successors, (909), 701 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 909 transitions. [2025-03-03 15:17:11,272 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 909 transitions. Word has length 97 [2025-03-03 15:17:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:11,272 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 909 transitions. [2025-03-03 15:17:11,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 909 transitions. [2025-03-03 15:17:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:11,274 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] [2025-03-03 15:17:11,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:17:11,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -217524038, now seen corresponding path program 1 times [2025-03-03 15:17:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486566071] [2025-03-03 15:17:11,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:11,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:11,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:11,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486566071] [2025-03-03 15:17:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486566071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416048057] [2025-03-03 15:17:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:11,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:11,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:11,501 INFO L87 Difference]: Start difference. First operand 702 states and 909 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:12,190 INFO L93 Difference]: Finished difference Result 1185 states and 1541 transitions. [2025-03-03 15:17:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:12,193 INFO L225 Difference]: With dead ends: 1185 [2025-03-03 15:17:12,193 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 15:17:12,193 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-03-03 15:17:12,194 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 3573 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:12,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3573 Valid, 2495 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 15:17:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2025-03-03 15:17:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3352941176470587) internal successors, (908), 701 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 908 transitions. [2025-03-03 15:17:12,202 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 908 transitions. Word has length 97 [2025-03-03 15:17:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:12,202 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 908 transitions. [2025-03-03 15:17:12,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 908 transitions. [2025-03-03 15:17:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:12,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:12,203 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] [2025-03-03 15:17:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:17:12,203 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash -641958918, now seen corresponding path program 1 times [2025-03-03 15:17:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881444567] [2025-03-03 15:17:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:12,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:12,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:12,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:12,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:12,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:12,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881444567] [2025-03-03 15:17:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881444567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035400520] [2025-03-03 15:17:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:12,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:12,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:12,455 INFO L87 Difference]: Start difference. First operand 702 states and 908 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:13,290 INFO L93 Difference]: Finished difference Result 1226 states and 1602 transitions. [2025-03-03 15:17:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:13,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:13,293 INFO L225 Difference]: With dead ends: 1226 [2025-03-03 15:17:13,293 INFO L226 Difference]: Without dead ends: 1079 [2025-03-03 15:17:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:13,294 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 3712 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3712 SdHoareTripleChecker+Valid, 3495 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:13,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3712 Valid, 3495 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-03-03 15:17:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 702. [2025-03-03 15:17:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3338235294117646) internal successors, (907), 701 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 907 transitions. [2025-03-03 15:17:13,302 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 907 transitions. Word has length 97 [2025-03-03 15:17:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:13,302 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 907 transitions. [2025-03-03 15:17:13,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 907 transitions. [2025-03-03 15:17:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:13,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:13,304 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] [2025-03-03 15:17:13,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:17:13,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:13,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash 870783034, now seen corresponding path program 1 times [2025-03-03 15:17:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134323596] [2025-03-03 15:17:13,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:13,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:13,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:13,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:13,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134323596] [2025-03-03 15:17:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134323596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004952637] [2025-03-03 15:17:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:13,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:13,513 INFO L87 Difference]: Start difference. First operand 702 states and 907 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:14,304 INFO L93 Difference]: Finished difference Result 1176 states and 1532 transitions. [2025-03-03 15:17:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:14,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:14,306 INFO L225 Difference]: With dead ends: 1176 [2025-03-03 15:17:14,306 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 15:17:14,307 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-03-03 15:17:14,307 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 4551 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4551 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:14,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4551 Valid, 2709 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 15:17:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2025-03-03 15:17:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3323529411764705) internal successors, (906), 701 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 906 transitions. [2025-03-03 15:17:14,316 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 906 transitions. Word has length 97 [2025-03-03 15:17:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:14,316 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 906 transitions. [2025-03-03 15:17:14,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 906 transitions. [2025-03-03 15:17:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:14,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:14,318 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] [2025-03-03 15:17:14,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:17:14,318 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:14,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1001389256, now seen corresponding path program 1 times [2025-03-03 15:17:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643833561] [2025-03-03 15:17:14,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:14,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:14,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:14,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643833561] [2025-03-03 15:17:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643833561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:14,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:14,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305091069] [2025-03-03 15:17:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:14,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:14,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:14,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:14,723 INFO L87 Difference]: Start difference. First operand 702 states and 906 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:16,238 INFO L93 Difference]: Finished difference Result 1534 states and 2055 transitions. [2025-03-03 15:17:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:16,242 INFO L225 Difference]: With dead ends: 1534 [2025-03-03 15:17:16,242 INFO L226 Difference]: Without dead ends: 1387 [2025-03-03 15:17:16,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:16,243 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 5537 mSDsluCounter, 3724 mSDsCounter, 0 mSdLazyCounter, 3289 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5537 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:16,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5537 Valid, 4530 Invalid, 3489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3289 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:17:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-03 15:17:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 707. [2025-03-03 15:17:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3299270072992702) internal successors, (911), 706 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 911 transitions. [2025-03-03 15:17:16,254 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 911 transitions. Word has length 97 [2025-03-03 15:17:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:16,254 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 911 transitions. [2025-03-03 15:17:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 911 transitions. [2025-03-03 15:17:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:16,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:16,255 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] [2025-03-03 15:17:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:17:16,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -350503254, now seen corresponding path program 1 times [2025-03-03 15:17:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124185578] [2025-03-03 15:17:16,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:16,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:16,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:16,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:16,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124185578] [2025-03-03 15:17:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124185578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:16,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804763134] [2025-03-03 15:17:16,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:16,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:16,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:16,470 INFO L87 Difference]: Start difference. First operand 707 states and 911 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:17,229 INFO L93 Difference]: Finished difference Result 1150 states and 1489 transitions. [2025-03-03 15:17:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:17,232 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:17,232 INFO L226 Difference]: Without dead ends: 1061 [2025-03-03 15:17:17,233 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-03-03 15:17:17,233 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3491 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:17,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 2522 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-03 15:17:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 707. [2025-03-03 15:17:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3284671532846715) internal successors, (910), 706 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 910 transitions. [2025-03-03 15:17:17,240 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 910 transitions. Word has length 97 [2025-03-03 15:17:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 910 transitions. [2025-03-03 15:17:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 910 transitions. [2025-03-03 15:17:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:17,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:17,241 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] [2025-03-03 15:17:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:17:17,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1270072806, now seen corresponding path program 1 times [2025-03-03 15:17:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364470943] [2025-03-03 15:17:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:17,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:17,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:17,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364470943] [2025-03-03 15:17:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364470943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:17,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:17,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831218606] [2025-03-03 15:17:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:17,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:17,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:17,620 INFO L87 Difference]: Start difference. First operand 707 states and 910 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:18,742 INFO L93 Difference]: Finished difference Result 1449 states and 1925 transitions. [2025-03-03 15:17:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:18,745 INFO L225 Difference]: With dead ends: 1449 [2025-03-03 15:17:18,745 INFO L226 Difference]: Without dead ends: 1345 [2025-03-03 15:17:18,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:18,746 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 8326 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8326 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:18,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8326 Valid, 2947 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-03 15:17:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 712. [2025-03-03 15:17:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.326086956521739) internal successors, (915), 711 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 915 transitions. [2025-03-03 15:17:18,753 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 915 transitions. Word has length 97 [2025-03-03 15:17:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:18,753 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 915 transitions. [2025-03-03 15:17:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 915 transitions. [2025-03-03 15:17:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:17:18,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:18,754 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] [2025-03-03 15:17:18,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:17:18,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1345615509, now seen corresponding path program 1 times [2025-03-03 15:17:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:18,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886734591] [2025-03-03 15:17:18,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:17:18,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:17:18,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:18,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886734591] [2025-03-03 15:17:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886734591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570033202] [2025-03-03 15:17:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:19,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:19,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:19,059 INFO L87 Difference]: Start difference. First operand 712 states and 915 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:19,874 INFO L93 Difference]: Finished difference Result 1150 states and 1487 transitions. [2025-03-03 15:17:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 15:17:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:19,877 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:19,877 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 15:17:19,877 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-03-03 15:17:19,878 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 4050 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4050 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:19,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4050 Valid, 3082 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 15:17:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 712. [2025-03-03 15:17:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.3246376811594203) internal successors, (914), 711 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 914 transitions. [2025-03-03 15:17:19,884 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 914 transitions. Word has length 97 [2025-03-03 15:17:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:19,884 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 914 transitions. [2025-03-03 15:17:19,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 914 transitions. [2025-03-03 15:17:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:19,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:19,885 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] [2025-03-03 15:17:19,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:17:19,886 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:19,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2123066080, now seen corresponding path program 1 times [2025-03-03 15:17:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:19,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373229812] [2025-03-03 15:17:19,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:19,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:19,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:19,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:19,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373229812] [2025-03-03 15:17:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373229812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153976839] [2025-03-03 15:17:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:20,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:20,100 INFO L87 Difference]: Start difference. First operand 712 states and 914 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:20,750 INFO L93 Difference]: Finished difference Result 1151 states and 1487 transitions. [2025-03-03 15:17:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:20,753 INFO L225 Difference]: With dead ends: 1151 [2025-03-03 15:17:20,753 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 15:17:20,753 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-03-03 15:17:20,754 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3485 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3485 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:20,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3485 Valid, 2525 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 15:17:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 712. [2025-03-03 15:17:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.3231884057971015) internal successors, (913), 711 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 913 transitions. [2025-03-03 15:17:20,763 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 913 transitions. Word has length 98 [2025-03-03 15:17:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 913 transitions. [2025-03-03 15:17:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 913 transitions. [2025-03-03 15:17:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:20,764 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] [2025-03-03 15:17:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:17:20,765 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1448302864, now seen corresponding path program 1 times [2025-03-03 15:17:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733231616] [2025-03-03 15:17:20,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:20,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:20,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:20,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:20,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:20,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733231616] [2025-03-03 15:17:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733231616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:20,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:20,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214608477] [2025-03-03 15:17:20,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:20,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:20,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:20,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:20,986 INFO L87 Difference]: Start difference. First operand 712 states and 913 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:21,656 INFO L93 Difference]: Finished difference Result 1181 states and 1532 transitions. [2025-03-03 15:17:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:21,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:21,659 INFO L225 Difference]: With dead ends: 1181 [2025-03-03 15:17:21,659 INFO L226 Difference]: Without dead ends: 1077 [2025-03-03 15:17:21,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:21,660 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 4699 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4699 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:21,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4699 Valid, 2625 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-03 15:17:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 712. [2025-03-03 15:17:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.3217391304347825) internal successors, (912), 711 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 912 transitions. [2025-03-03 15:17:21,667 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 912 transitions. Word has length 98 [2025-03-03 15:17:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:21,667 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 912 transitions. [2025-03-03 15:17:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 912 transitions. [2025-03-03 15:17:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:21,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:21,668 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] [2025-03-03 15:17:21,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:17:21,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 437361200, now seen corresponding path program 1 times [2025-03-03 15:17:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411868651] [2025-03-03 15:17:21,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:21,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:21,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:21,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411868651] [2025-03-03 15:17:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411868651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996739062] [2025-03-03 15:17:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:21,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:21,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:21,950 INFO L87 Difference]: Start difference. First operand 712 states and 912 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:22,665 INFO L93 Difference]: Finished difference Result 1151 states and 1485 transitions. [2025-03-03 15:17:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:22,670 INFO L225 Difference]: With dead ends: 1151 [2025-03-03 15:17:22,670 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 15:17:22,671 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-03-03 15:17:22,674 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 2228 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:22,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 2616 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 15:17:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 712. [2025-03-03 15:17:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.3202898550724638) internal successors, (911), 711 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 911 transitions. [2025-03-03 15:17:22,686 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 911 transitions. Word has length 98 [2025-03-03 15:17:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:22,686 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 911 transitions. [2025-03-03 15:17:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 911 transitions. [2025-03-03 15:17:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:22,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:22,688 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] [2025-03-03 15:17:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:17:22,688 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash -139865824, now seen corresponding path program 1 times [2025-03-03 15:17:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500332208] [2025-03-03 15:17:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:22,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:22,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:22,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500332208] [2025-03-03 15:17:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500332208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424666688] [2025-03-03 15:17:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:22,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:22,926 INFO L87 Difference]: Start difference. First operand 712 states and 911 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:23,687 INFO L93 Difference]: Finished difference Result 1151 states and 1484 transitions. [2025-03-03 15:17:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:23,690 INFO L225 Difference]: With dead ends: 1151 [2025-03-03 15:17:23,690 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 15:17:23,690 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-03-03 15:17:23,691 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3992 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3992 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:23,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3992 Valid, 3173 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 15:17:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 712. [2025-03-03 15:17:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.318840579710145) internal successors, (910), 711 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 910 transitions. [2025-03-03 15:17:23,697 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 910 transitions. Word has length 98 [2025-03-03 15:17:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:23,697 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 910 transitions. [2025-03-03 15:17:23,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 910 transitions. [2025-03-03 15:17:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:23,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:23,699 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] [2025-03-03 15:17:23,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:17:23,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:23,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash 885360693, now seen corresponding path program 1 times [2025-03-03 15:17:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34914277] [2025-03-03 15:17:23,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:23,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:23,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34914277] [2025-03-03 15:17:23,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34914277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:23,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:23,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685113374] [2025-03-03 15:17:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:23,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:23,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:23,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:23,914 INFO L87 Difference]: Start difference. First operand 712 states and 910 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:24,619 INFO L93 Difference]: Finished difference Result 1110 states and 1417 transitions. [2025-03-03 15:17:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:24,622 INFO L225 Difference]: With dead ends: 1110 [2025-03-03 15:17:24,622 INFO L226 Difference]: Without dead ends: 1034 [2025-03-03 15:17:24,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:24,627 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 4731 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:24,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 2323 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-03 15:17:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 712. [2025-03-03 15:17:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.317391304347826) internal successors, (909), 711 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 909 transitions. [2025-03-03 15:17:24,634 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 909 transitions. Word has length 98 [2025-03-03 15:17:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:24,634 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 909 transitions. [2025-03-03 15:17:24,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 909 transitions. [2025-03-03 15:17:24,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:24,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:24,635 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] [2025-03-03 15:17:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:17:24,635 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:24,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash -343361328, now seen corresponding path program 1 times [2025-03-03 15:17:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:24,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753544220] [2025-03-03 15:17:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:24,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:24,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:24,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:24,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753544220] [2025-03-03 15:17:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753544220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589095946] [2025-03-03 15:17:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:24,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:24,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:24,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:24,971 INFO L87 Difference]: Start difference. First operand 712 states and 909 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:25,691 INFO L93 Difference]: Finished difference Result 1151 states and 1482 transitions. [2025-03-03 15:17:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:25,693 INFO L225 Difference]: With dead ends: 1151 [2025-03-03 15:17:25,693 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 15:17:25,694 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-03-03 15:17:25,694 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 3355 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3355 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:25,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3355 Valid, 2601 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 15:17:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 712. [2025-03-03 15:17:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 690 states have (on average 1.3159420289855073) internal successors, (908), 711 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 908 transitions. [2025-03-03 15:17:25,703 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 908 transitions. Word has length 98 [2025-03-03 15:17:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 908 transitions. [2025-03-03 15:17:25,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 908 transitions. [2025-03-03 15:17:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:25,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:25,704 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] [2025-03-03 15:17:25,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:17:25,704 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1292466990, now seen corresponding path program 1 times [2025-03-03 15:17:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301905798] [2025-03-03 15:17:25,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:25,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301905798] [2025-03-03 15:17:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301905798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261953262] [2025-03-03 15:17:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:25,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:25,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:25,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:25,904 INFO L87 Difference]: Start difference. First operand 712 states and 908 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:26,610 INFO L93 Difference]: Finished difference Result 1181 states and 1526 transitions. [2025-03-03 15:17:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:26,612 INFO L225 Difference]: With dead ends: 1181 [2025-03-03 15:17:26,612 INFO L226 Difference]: Without dead ends: 1077 [2025-03-03 15:17:26,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:26,613 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 4565 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:26,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 2694 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-03 15:17:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 707. [2025-03-03 15:17:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3167883211678832) internal successors, (902), 706 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 902 transitions. [2025-03-03 15:17:26,618 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 902 transitions. Word has length 98 [2025-03-03 15:17:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:26,619 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 902 transitions. [2025-03-03 15:17:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 902 transitions. [2025-03-03 15:17:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:17:26,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:26,619 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] [2025-03-03 15:17:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:17:26,619 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 880049897, now seen corresponding path program 1 times [2025-03-03 15:17:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862023943] [2025-03-03 15:17:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:17:26,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:17:26,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:26,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862023943] [2025-03-03 15:17:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862023943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005828738] [2025-03-03 15:17:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:26,809 INFO L87 Difference]: Start difference. First operand 707 states and 902 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:27,670 INFO L93 Difference]: Finished difference Result 1226 states and 1592 transitions. [2025-03-03 15:17:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2025-03-03 15:17:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:27,672 INFO L225 Difference]: With dead ends: 1226 [2025-03-03 15:17:27,672 INFO L226 Difference]: Without dead ends: 1079 [2025-03-03 15:17:27,672 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-03-03 15:17:27,673 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 2713 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2713 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:27,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2713 Valid, 3480 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-03-03 15:17:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 702. [2025-03-03 15:17:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3176470588235294) internal successors, (896), 701 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 896 transitions. [2025-03-03 15:17:27,678 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 896 transitions. Word has length 98 [2025-03-03 15:17:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 896 transitions. [2025-03-03 15:17:27,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 896 transitions. [2025-03-03 15:17:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:27,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:27,679 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] [2025-03-03 15:17:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:17:27,679 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:27,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 294019382, now seen corresponding path program 1 times [2025-03-03 15:17:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050969974] [2025-03-03 15:17:27,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:27,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:27,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:27,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050969974] [2025-03-03 15:17:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050969974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295090317] [2025-03-03 15:17:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:27,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:27,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:27,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:27,862 INFO L87 Difference]: Start difference. First operand 702 states and 896 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:28,606 INFO L93 Difference]: Finished difference Result 1191 states and 1533 transitions. [2025-03-03 15:17:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:28,607 INFO L225 Difference]: With dead ends: 1191 [2025-03-03 15:17:28,607 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 15:17:28,608 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-03-03 15:17:28,608 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 3127 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3127 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:28,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3127 Valid, 2933 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 15:17:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2025-03-03 15:17:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3161764705882353) internal successors, (895), 701 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 895 transitions. [2025-03-03 15:17:28,613 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 895 transitions. Word has length 99 [2025-03-03 15:17:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:28,614 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 895 transitions. [2025-03-03 15:17:28,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 895 transitions. [2025-03-03 15:17:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:28,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:28,614 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] [2025-03-03 15:17:28,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:17:28,614 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:28,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1168131658, now seen corresponding path program 1 times [2025-03-03 15:17:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131627864] [2025-03-03 15:17:28,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:28,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:28,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:28,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:28,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131627864] [2025-03-03 15:17:28,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131627864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:28,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:28,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815431318] [2025-03-03 15:17:28,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:28,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:28,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:28,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:28,781 INFO L87 Difference]: Start difference. First operand 702 states and 895 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:29,509 INFO L93 Difference]: Finished difference Result 1150 states and 1475 transitions. [2025-03-03 15:17:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:29,511 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:29,511 INFO L226 Difference]: Without dead ends: 1056 [2025-03-03 15:17:29,512 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-03-03 15:17:29,512 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 2117 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:29,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2117 Valid, 2838 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-03 15:17:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 702. [2025-03-03 15:17:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3147058823529412) internal successors, (894), 701 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 894 transitions. [2025-03-03 15:17:29,518 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 894 transitions. Word has length 99 [2025-03-03 15:17:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:29,518 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 894 transitions. [2025-03-03 15:17:29,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 894 transitions. [2025-03-03 15:17:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:29,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:29,519 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] [2025-03-03 15:17:29,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:17:29,519 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:29,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1108303606, now seen corresponding path program 1 times [2025-03-03 15:17:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:29,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197546572] [2025-03-03 15:17:29,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:29,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:29,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:29,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:29,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:29,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197546572] [2025-03-03 15:17:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197546572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:29,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:29,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089795106] [2025-03-03 15:17:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:29,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:29,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:29,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:29,847 INFO L87 Difference]: Start difference. First operand 702 states and 894 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:31,057 INFO L93 Difference]: Finished difference Result 1549 states and 2048 transitions. [2025-03-03 15:17:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:31,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:31,060 INFO L225 Difference]: With dead ends: 1549 [2025-03-03 15:17:31,060 INFO L226 Difference]: Without dead ends: 1387 [2025-03-03 15:17:31,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:31,061 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 6745 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6745 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:31,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6745 Valid, 3726 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-03 15:17:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 707. [2025-03-03 15:17:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3124087591240876) internal successors, (899), 706 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 899 transitions. [2025-03-03 15:17:31,068 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 899 transitions. Word has length 99 [2025-03-03 15:17:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 899 transitions. [2025-03-03 15:17:31,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 899 transitions. [2025-03-03 15:17:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:31,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:31,069 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] [2025-03-03 15:17:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:17:31,069 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1913368778, now seen corresponding path program 1 times [2025-03-03 15:17:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370862030] [2025-03-03 15:17:31,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:31,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:31,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:31,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:31,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370862030] [2025-03-03 15:17:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370862030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:31,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:31,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162361883] [2025-03-03 15:17:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:31,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:31,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:31,261 INFO L87 Difference]: Start difference. First operand 707 states and 899 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:31,972 INFO L93 Difference]: Finished difference Result 1190 states and 1529 transitions. [2025-03-03 15:17:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:31,973 INFO L225 Difference]: With dead ends: 1190 [2025-03-03 15:17:31,973 INFO L226 Difference]: Without dead ends: 1077 [2025-03-03 15:17:31,973 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-03-03 15:17:31,974 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 4265 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:31,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 2936 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-03 15:17:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 707. [2025-03-03 15:17:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3109489051094891) internal successors, (898), 706 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 898 transitions. [2025-03-03 15:17:31,979 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 898 transitions. Word has length 99 [2025-03-03 15:17:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:31,979 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 898 transitions. [2025-03-03 15:17:31,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 898 transitions. [2025-03-03 15:17:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:31,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:31,980 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] [2025-03-03 15:17:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:17:31,980 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:31,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 561762294, now seen corresponding path program 1 times [2025-03-03 15:17:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691181626] [2025-03-03 15:17:31,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:32,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:32,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:32,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:32,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:32,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691181626] [2025-03-03 15:17:32,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691181626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:32,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:32,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57663570] [2025-03-03 15:17:32,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:32,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:32,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:32,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:32,140 INFO L87 Difference]: Start difference. First operand 707 states and 898 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:32,785 INFO L93 Difference]: Finished difference Result 1110 states and 1410 transitions. [2025-03-03 15:17:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:32,787 INFO L225 Difference]: With dead ends: 1110 [2025-03-03 15:17:32,787 INFO L226 Difference]: Without dead ends: 1029 [2025-03-03 15:17:32,789 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-03-03 15:17:32,790 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 3399 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3399 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:32,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3399 Valid, 2410 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-03 15:17:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 707. [2025-03-03 15:17:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3094890510948904) internal successors, (897), 706 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 897 transitions. [2025-03-03 15:17:32,810 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 897 transitions. Word has length 99 [2025-03-03 15:17:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 897 transitions. [2025-03-03 15:17:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 897 transitions. [2025-03-03 15:17:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:32,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:32,812 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] [2025-03-03 15:17:32,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:17:32,812 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:32,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -876145562, now seen corresponding path program 1 times [2025-03-03 15:17:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:32,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476729016] [2025-03-03 15:17:32,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:32,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:32,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476729016] [2025-03-03 15:17:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476729016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749066272] [2025-03-03 15:17:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:33,061 INFO L87 Difference]: Start difference. First operand 707 states and 897 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:33,839 INFO L93 Difference]: Finished difference Result 1150 states and 1472 transitions. [2025-03-03 15:17:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:33,841 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:33,841 INFO L226 Difference]: Without dead ends: 1061 [2025-03-03 15:17:33,841 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-03-03 15:17:33,842 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 3810 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:33,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3810 Valid, 3514 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-03 15:17:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 707. [2025-03-03 15:17:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.308029197080292) internal successors, (896), 706 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 896 transitions. [2025-03-03 15:17:33,847 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 896 transitions. Word has length 99 [2025-03-03 15:17:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 896 transitions. [2025-03-03 15:17:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 896 transitions. [2025-03-03 15:17:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:33,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:33,848 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] [2025-03-03 15:17:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:17:33,848 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1476764438, now seen corresponding path program 1 times [2025-03-03 15:17:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105070101] [2025-03-03 15:17:33,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:33,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:33,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:33,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105070101] [2025-03-03 15:17:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105070101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:34,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:34,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050633310] [2025-03-03 15:17:34,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:34,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:34,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:34,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:34,025 INFO L87 Difference]: Start difference. First operand 707 states and 896 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:34,766 INFO L93 Difference]: Finished difference Result 1150 states and 1471 transitions. [2025-03-03 15:17:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:34,768 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:34,768 INFO L226 Difference]: Without dead ends: 1061 [2025-03-03 15:17:34,768 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-03-03 15:17:34,768 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 3089 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3089 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:34,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3089 Valid, 2942 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-03 15:17:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 707. [2025-03-03 15:17:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.3065693430656935) internal successors, (895), 706 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 895 transitions. [2025-03-03 15:17:34,773 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 895 transitions. Word has length 99 [2025-03-03 15:17:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:34,773 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 895 transitions. [2025-03-03 15:17:34,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 895 transitions. [2025-03-03 15:17:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:34,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:34,774 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] [2025-03-03 15:17:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:17:34,774 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:34,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1772590946, now seen corresponding path program 1 times [2025-03-03 15:17:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163434501] [2025-03-03 15:17:34,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:34,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:34,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163434501] [2025-03-03 15:17:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163434501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075117056] [2025-03-03 15:17:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:34,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:34,954 INFO L87 Difference]: Start difference. First operand 707 states and 895 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:35,691 INFO L93 Difference]: Finished difference Result 1104 states and 1400 transitions. [2025-03-03 15:17:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:35,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:35,693 INFO L225 Difference]: With dead ends: 1104 [2025-03-03 15:17:35,693 INFO L226 Difference]: Without dead ends: 1028 [2025-03-03 15:17:35,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:35,694 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 4468 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:35,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 2487 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-03-03 15:17:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 706. [2025-03-03 15:17:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3055555555555556) internal successors, (893), 705 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 893 transitions. [2025-03-03 15:17:35,699 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 893 transitions. Word has length 99 [2025-03-03 15:17:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 893 transitions. [2025-03-03 15:17:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 893 transitions. [2025-03-03 15:17:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:35,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:35,700 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] [2025-03-03 15:17:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:17:35,701 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1335488180, now seen corresponding path program 1 times [2025-03-03 15:17:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:35,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151418056] [2025-03-03 15:17:35,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:35,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:35,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:35,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151418056] [2025-03-03 15:17:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151418056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595008600] [2025-03-03 15:17:35,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:35,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:35,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:35,858 INFO L87 Difference]: Start difference. First operand 706 states and 893 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:36,547 INFO L93 Difference]: Finished difference Result 1154 states and 1472 transitions. [2025-03-03 15:17:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:36,548 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 15:17:36,548 INFO L226 Difference]: Without dead ends: 1060 [2025-03-03 15:17:36,549 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-03-03 15:17:36,549 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 4065 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:36,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 2954 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-03 15:17:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2025-03-03 15:17:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.304093567251462) internal successors, (892), 705 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 892 transitions. [2025-03-03 15:17:36,554 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 892 transitions. Word has length 99 [2025-03-03 15:17:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:36,554 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 892 transitions. [2025-03-03 15:17:36,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 892 transitions. [2025-03-03 15:17:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:36,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:36,555 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] [2025-03-03 15:17:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:17:36,555 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1707871466, now seen corresponding path program 1 times [2025-03-03 15:17:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116218635] [2025-03-03 15:17:36,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:36,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:36,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:36,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:36,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116218635] [2025-03-03 15:17:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116218635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33634766] [2025-03-03 15:17:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:36,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:36,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:36,732 INFO L87 Difference]: Start difference. First operand 706 states and 892 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:37,457 INFO L93 Difference]: Finished difference Result 1189 states and 1519 transitions. [2025-03-03 15:17:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:37,459 INFO L225 Difference]: With dead ends: 1189 [2025-03-03 15:17:37,459 INFO L226 Difference]: Without dead ends: 1076 [2025-03-03 15:17:37,460 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-03-03 15:17:37,460 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1941 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:37,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 3171 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-03 15:17:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 706. [2025-03-03 15:17:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3026315789473684) internal successors, (891), 705 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 891 transitions. [2025-03-03 15:17:37,466 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 891 transitions. Word has length 99 [2025-03-03 15:17:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:37,466 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 891 transitions. [2025-03-03 15:17:37,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 891 transitions. [2025-03-03 15:17:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:37,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:37,467 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] [2025-03-03 15:17:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:17:37,467 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1124944790, now seen corresponding path program 1 times [2025-03-03 15:17:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184779411] [2025-03-03 15:17:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:37,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:37,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184779411] [2025-03-03 15:17:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184779411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805763620] [2025-03-03 15:17:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:37,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:37,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:37,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:37,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:37,687 INFO L87 Difference]: Start difference. First operand 706 states and 891 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:38,502 INFO L93 Difference]: Finished difference Result 1149 states and 1465 transitions. [2025-03-03 15:17:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:38,504 INFO L225 Difference]: With dead ends: 1149 [2025-03-03 15:17:38,504 INFO L226 Difference]: Without dead ends: 1060 [2025-03-03 15:17:38,505 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-03-03 15:17:38,505 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 3737 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3737 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:38,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3737 Valid, 3633 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-03 15:17:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2025-03-03 15:17:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3011695906432748) internal successors, (890), 705 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 890 transitions. [2025-03-03 15:17:38,510 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 890 transitions. Word has length 99 [2025-03-03 15:17:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:38,510 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 890 transitions. [2025-03-03 15:17:38,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 890 transitions. [2025-03-03 15:17:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:38,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:38,511 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] [2025-03-03 15:17:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:17:38,511 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1615377802, now seen corresponding path program 1 times [2025-03-03 15:17:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728183483] [2025-03-03 15:17:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:38,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:38,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:38,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728183483] [2025-03-03 15:17:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728183483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606315273] [2025-03-03 15:17:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:38,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:38,689 INFO L87 Difference]: Start difference. First operand 706 states and 890 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:39,446 INFO L93 Difference]: Finished difference Result 1149 states and 1463 transitions. [2025-03-03 15:17:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:39,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:39,448 INFO L225 Difference]: With dead ends: 1149 [2025-03-03 15:17:39,448 INFO L226 Difference]: Without dead ends: 1060 [2025-03-03 15:17:39,448 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-03-03 15:17:39,448 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 2873 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2873 SdHoareTripleChecker+Valid, 3618 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:39,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2873 Valid, 3618 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-03 15:17:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2025-03-03 15:17:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 705 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 889 transitions. [2025-03-03 15:17:39,453 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 889 transitions. Word has length 99 [2025-03-03 15:17:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:39,453 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 889 transitions. [2025-03-03 15:17:39,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 889 transitions. [2025-03-03 15:17:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:39,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:39,454 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] [2025-03-03 15:17:39,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:17:39,454 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -973055624, now seen corresponding path program 1 times [2025-03-03 15:17:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:39,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962744845] [2025-03-03 15:17:39,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:39,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:39,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:39,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:39,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962744845] [2025-03-03 15:17:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962744845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953341767] [2025-03-03 15:17:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:39,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:39,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:39,619 INFO L87 Difference]: Start difference. First operand 706 states and 889 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:40,253 INFO L93 Difference]: Finished difference Result 1103 states and 1394 transitions. [2025-03-03 15:17:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:40,255 INFO L225 Difference]: With dead ends: 1103 [2025-03-03 15:17:40,255 INFO L226 Difference]: Without dead ends: 1027 [2025-03-03 15:17:40,255 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-03-03 15:17:40,255 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 4213 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 2628 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-03 15:17:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 705. [2025-03-03 15:17:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 683 states have (on average 1.2986822840409955) internal successors, (887), 704 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 887 transitions. [2025-03-03 15:17:40,262 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 887 transitions. Word has length 99 [2025-03-03 15:17:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:40,263 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 887 transitions. [2025-03-03 15:17:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 887 transitions. [2025-03-03 15:17:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:17:40,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:40,264 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] [2025-03-03 15:17:40,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:17:40,264 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 737804008, now seen corresponding path program 1 times [2025-03-03 15:17:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:40,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599485359] [2025-03-03 15:17:40,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:40,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:17:40,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:17:40,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:40,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599485359] [2025-03-03 15:17:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599485359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:17:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219444501] [2025-03-03 15:17:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:40,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:40,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:40,842 INFO L87 Difference]: Start difference. First operand 705 states and 887 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:41,287 INFO L93 Difference]: Finished difference Result 1150 states and 1475 transitions. [2025-03-03 15:17:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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 99 [2025-03-03 15:17:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:41,289 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 15:17:41,289 INFO L226 Difference]: Without dead ends: 1027 [2025-03-03 15:17:41,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:17:41,290 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 4191 mSDsluCounter, 4142 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4191 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:41,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4191 Valid, 5266 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-03 15:17:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 657. [2025-03-03 15:17:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2929133858267716) internal successors, (821), 656 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 821 transitions. [2025-03-03 15:17:41,295 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 821 transitions. Word has length 99 [2025-03-03 15:17:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:41,295 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 821 transitions. [2025-03-03 15:17:41,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 821 transitions. [2025-03-03 15:17:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:41,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:41,296 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] [2025-03-03 15:17:41,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:17:41,296 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 848705413, now seen corresponding path program 1 times [2025-03-03 15:17:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413659746] [2025-03-03 15:17:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:41,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:41,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:41,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:41,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413659746] [2025-03-03 15:17:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413659746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679335371] [2025-03-03 15:17:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:41,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:41,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:41,535 INFO L87 Difference]: Start difference. First operand 657 states and 821 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:42,296 INFO L93 Difference]: Finished difference Result 1075 states and 1360 transitions. [2025-03-03 15:17:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:42,298 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 15:17:42,298 INFO L226 Difference]: Without dead ends: 986 [2025-03-03 15:17:42,299 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-03-03 15:17:42,299 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 3450 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3450 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:42,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3450 Valid, 3364 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-03 15:17:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 657. [2025-03-03 15:17:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2913385826771653) internal successors, (820), 656 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 820 transitions. [2025-03-03 15:17:42,304 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 820 transitions. Word has length 100 [2025-03-03 15:17:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:42,304 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 820 transitions. [2025-03-03 15:17:42,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 820 transitions. [2025-03-03 15:17:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:42,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:42,305 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] [2025-03-03 15:17:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:17:42,305 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1493446844, now seen corresponding path program 1 times [2025-03-03 15:17:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963138234] [2025-03-03 15:17:42,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:42,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:42,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:42,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963138234] [2025-03-03 15:17:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963138234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60058804] [2025-03-03 15:17:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:42,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:42,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:42,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:42,540 INFO L87 Difference]: Start difference. First operand 657 states and 820 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:43,260 INFO L93 Difference]: Finished difference Result 1036 states and 1301 transitions. [2025-03-03 15:17:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:43,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:43,262 INFO L225 Difference]: With dead ends: 1036 [2025-03-03 15:17:43,262 INFO L226 Difference]: Without dead ends: 958 [2025-03-03 15:17:43,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:43,263 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 3921 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:43,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 2476 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-03 15:17:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 657. [2025-03-03 15:17:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2897637795275592) internal successors, (819), 656 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 819 transitions. [2025-03-03 15:17:43,268 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 819 transitions. Word has length 100 [2025-03-03 15:17:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:43,268 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 819 transitions. [2025-03-03 15:17:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 819 transitions. [2025-03-03 15:17:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:43,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:43,269 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] [2025-03-03 15:17:43,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:17:43,269 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 326401332, now seen corresponding path program 1 times [2025-03-03 15:17:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364461427] [2025-03-03 15:17:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:43,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:43,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:43,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:43,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364461427] [2025-03-03 15:17:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364461427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140699307] [2025-03-03 15:17:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:43,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:43,501 INFO L87 Difference]: Start difference. First operand 657 states and 819 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:44,142 INFO L93 Difference]: Finished difference Result 1036 states and 1300 transitions. [2025-03-03 15:17:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:44,145 INFO L225 Difference]: With dead ends: 1036 [2025-03-03 15:17:44,145 INFO L226 Difference]: Without dead ends: 958 [2025-03-03 15:17:44,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:44,146 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 3917 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3917 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:44,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3917 Valid, 2480 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-03 15:17:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 657. [2025-03-03 15:17:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2881889763779528) internal successors, (818), 656 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 818 transitions. [2025-03-03 15:17:44,150 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 818 transitions. Word has length 100 [2025-03-03 15:17:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:44,151 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 818 transitions. [2025-03-03 15:17:44,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 818 transitions. [2025-03-03 15:17:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:44,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:44,152 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] [2025-03-03 15:17:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:17:44,152 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 253094820, now seen corresponding path program 1 times [2025-03-03 15:17:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:44,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325142192] [2025-03-03 15:17:44,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:44,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:44,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:44,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:44,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325142192] [2025-03-03 15:17:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325142192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:44,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:44,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:44,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547387780] [2025-03-03 15:17:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:44,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:44,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:44,325 INFO L87 Difference]: Start difference. First operand 657 states and 818 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:44,971 INFO L93 Difference]: Finished difference Result 1036 states and 1299 transitions. [2025-03-03 15:17:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:44,973 INFO L225 Difference]: With dead ends: 1036 [2025-03-03 15:17:44,973 INFO L226 Difference]: Without dead ends: 958 [2025-03-03 15:17:44,974 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-03-03 15:17:44,974 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2752 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 2682 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-03 15:17:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 657. [2025-03-03 15:17:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2866141732283465) internal successors, (817), 656 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 817 transitions. [2025-03-03 15:17:44,978 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 817 transitions. Word has length 100 [2025-03-03 15:17:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:44,978 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 817 transitions. [2025-03-03 15:17:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 817 transitions. [2025-03-03 15:17:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:44,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:44,979 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] [2025-03-03 15:17:44,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:17:44,979 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:44,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 95060308, now seen corresponding path program 1 times [2025-03-03 15:17:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190888290] [2025-03-03 15:17:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:44,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:45,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:45,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190888290] [2025-03-03 15:17:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190888290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119063349] [2025-03-03 15:17:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:45,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:45,279 INFO L87 Difference]: Start difference. First operand 657 states and 817 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:46,230 INFO L93 Difference]: Finished difference Result 1224 states and 1568 transitions. [2025-03-03 15:17:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:46,232 INFO L225 Difference]: With dead ends: 1224 [2025-03-03 15:17:46,232 INFO L226 Difference]: Without dead ends: 1146 [2025-03-03 15:17:46,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:46,233 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 7128 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7128 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:46,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7128 Valid, 2592 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-03 15:17:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 662. [2025-03-03 15:17:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.284375) internal successors, (822), 661 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 822 transitions. [2025-03-03 15:17:46,238 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 822 transitions. Word has length 100 [2025-03-03 15:17:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:46,238 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 822 transitions. [2025-03-03 15:17:46,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 822 transitions. [2025-03-03 15:17:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:46,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:46,238 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] [2025-03-03 15:17:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:17:46,239 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1579305331, now seen corresponding path program 1 times [2025-03-03 15:17:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433011950] [2025-03-03 15:17:46,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:46,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:46,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:46,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:46,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-03-03 15:17:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433011950] [2025-03-03 15:17:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433011950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:46,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870952055] [2025-03-03 15:17:46,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:46,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:46,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:46,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:46,421 INFO L87 Difference]: Start difference. First operand 662 states and 822 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:47,116 INFO L93 Difference]: Finished difference Result 1196 states and 1513 transitions. [2025-03-03 15:17:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:47,118 INFO L225 Difference]: With dead ends: 1196 [2025-03-03 15:17:47,118 INFO L226 Difference]: Without dead ends: 1034 [2025-03-03 15:17:47,119 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-03-03 15:17:47,119 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1660 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:47,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 3392 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-03 15:17:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 657. [2025-03-03 15:17:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2850393700787401) internal successors, (816), 656 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 816 transitions. [2025-03-03 15:17:47,124 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 816 transitions. Word has length 100 [2025-03-03 15:17:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 816 transitions. [2025-03-03 15:17:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 816 transitions. [2025-03-03 15:17:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:47,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:47,125 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] [2025-03-03 15:17:47,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:17:47,125 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash 594234900, now seen corresponding path program 1 times [2025-03-03 15:17:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56494901] [2025-03-03 15:17:47,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:47,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:47,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:47,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:47,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56494901] [2025-03-03 15:17:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56494901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790554019] [2025-03-03 15:17:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:47,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:47,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:47,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:47,339 INFO L87 Difference]: Start difference. First operand 657 states and 816 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:47,971 INFO L93 Difference]: Finished difference Result 1031 states and 1291 transitions. [2025-03-03 15:17:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:47,973 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:17:47,973 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:47,973 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-03-03 15:17:47,973 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 3621 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:47,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3621 Valid, 2670 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 657. [2025-03-03 15:17:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2834645669291338) internal successors, (815), 656 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 815 transitions. [2025-03-03 15:17:47,978 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 815 transitions. Word has length 100 [2025-03-03 15:17:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:47,979 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 815 transitions. [2025-03-03 15:17:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 815 transitions. [2025-03-03 15:17:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:47,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:47,980 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] [2025-03-03 15:17:47,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:17:47,980 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:47,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1202496284, now seen corresponding path program 1 times [2025-03-03 15:17:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493868999] [2025-03-03 15:17:47,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:47,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:48,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:48,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493868999] [2025-03-03 15:17:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493868999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:48,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765308021] [2025-03-03 15:17:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:48,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:48,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:48,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:48,273 INFO L87 Difference]: Start difference. First operand 657 states and 815 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:49,270 INFO L93 Difference]: Finished difference Result 1219 states and 1560 transitions. [2025-03-03 15:17:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:49,272 INFO L225 Difference]: With dead ends: 1219 [2025-03-03 15:17:49,272 INFO L226 Difference]: Without dead ends: 1141 [2025-03-03 15:17:49,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:49,272 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 7046 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7046 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7046 Valid, 3131 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-03 15:17:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 662. [2025-03-03 15:17:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.28125) internal successors, (820), 661 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 820 transitions. [2025-03-03 15:17:49,277 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 820 transitions. Word has length 100 [2025-03-03 15:17:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 820 transitions. [2025-03-03 15:17:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 820 transitions. [2025-03-03 15:17:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:49,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:49,278 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] [2025-03-03 15:17:49,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:17:49,278 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 324064756, now seen corresponding path program 1 times [2025-03-03 15:17:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:49,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822809613] [2025-03-03 15:17:49,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:49,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822809613] [2025-03-03 15:17:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822809613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198376134] [2025-03-03 15:17:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:49,479 INFO L87 Difference]: Start difference. First operand 662 states and 820 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:50,077 INFO L93 Difference]: Finished difference Result 1029 states and 1287 transitions. [2025-03-03 15:17:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:50,079 INFO L225 Difference]: With dead ends: 1029 [2025-03-03 15:17:50,079 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:50,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:50,079 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 3920 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3920 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:50,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3920 Valid, 2460 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2796875) internal successors, (819), 661 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 819 transitions. [2025-03-03 15:17:50,084 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 819 transitions. Word has length 100 [2025-03-03 15:17:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:50,084 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 819 transitions. [2025-03-03 15:17:50,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 819 transitions. [2025-03-03 15:17:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:50,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:50,084 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] [2025-03-03 15:17:50,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:17:50,084 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1318963099, now seen corresponding path program 1 times [2025-03-03 15:17:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926446627] [2025-03-03 15:17:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:50,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926446627] [2025-03-03 15:17:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926446627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:50,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:50,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315901154] [2025-03-03 15:17:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:50,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:50,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:50,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:50,258 INFO L87 Difference]: Start difference. First operand 662 states and 819 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:50,828 INFO L93 Difference]: Finished difference Result 1031 states and 1288 transitions. [2025-03-03 15:17:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:50,830 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:17:50,830 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:50,831 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-03-03 15:17:50,831 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 3527 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3527 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:50,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3527 Valid, 2466 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.278125) internal successors, (818), 661 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 818 transitions. [2025-03-03 15:17:50,835 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 818 transitions. Word has length 100 [2025-03-03 15:17:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:50,835 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 818 transitions. [2025-03-03 15:17:50,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 818 transitions. [2025-03-03 15:17:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:50,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:50,836 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] [2025-03-03 15:17:50,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:17:50,837 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:50,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2002868028, now seen corresponding path program 1 times [2025-03-03 15:17:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61887722] [2025-03-03 15:17:50,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61887722] [2025-03-03 15:17:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61887722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182149654] [2025-03-03 15:17:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:51,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:51,020 INFO L87 Difference]: Start difference. First operand 662 states and 818 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:51,649 INFO L93 Difference]: Finished difference Result 1031 states and 1287 transitions. [2025-03-03 15:17:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:51,650 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:17:51,650 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:51,651 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-03-03 15:17:51,651 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 3618 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3618 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:51,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3618 Valid, 2666 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2765625) internal successors, (817), 661 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 817 transitions. [2025-03-03 15:17:51,656 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 817 transitions. Word has length 100 [2025-03-03 15:17:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 817 transitions. [2025-03-03 15:17:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 817 transitions. [2025-03-03 15:17:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:51,657 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] [2025-03-03 15:17:51,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:17:51,657 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:51,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1641814060, now seen corresponding path program 1 times [2025-03-03 15:17:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557961622] [2025-03-03 15:17:51,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:51,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:51,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:51,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557961622] [2025-03-03 15:17:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557961622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609913458] [2025-03-03 15:17:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:51,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:51,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:51,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:51,843 INFO L87 Difference]: Start difference. First operand 662 states and 817 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:52,468 INFO L93 Difference]: Finished difference Result 1031 states and 1286 transitions. [2025-03-03 15:17:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:17:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:52,471 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:17:52,471 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:52,471 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-03-03 15:17:52,472 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 3519 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:52,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3519 Valid, 2455 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.275) internal successors, (816), 661 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 816 transitions. [2025-03-03 15:17:52,478 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 816 transitions. Word has length 100 [2025-03-03 15:17:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:52,479 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 816 transitions. [2025-03-03 15:17:52,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 816 transitions. [2025-03-03 15:17:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:52,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:52,480 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] [2025-03-03 15:17:52,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 15:17:52,480 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 968732578, now seen corresponding path program 1 times [2025-03-03 15:17:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368062441] [2025-03-03 15:17:52,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:52,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:52,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:52,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:52,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368062441] [2025-03-03 15:17:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368062441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127545818] [2025-03-03 15:17:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:52,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:52,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:52,684 INFO L87 Difference]: Start difference. First operand 662 states and 816 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:53,269 INFO L93 Difference]: Finished difference Result 1034 states and 1287 transitions. [2025-03-03 15:17:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:53,270 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 15:17:53,270 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:53,271 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-03-03 15:17:53,271 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 3513 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3513 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:53,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3513 Valid, 2470 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2734375) internal successors, (815), 661 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 815 transitions. [2025-03-03 15:17:53,276 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 815 transitions. Word has length 101 [2025-03-03 15:17:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:53,276 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 815 transitions. [2025-03-03 15:17:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 815 transitions. [2025-03-03 15:17:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:53,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:53,277 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] [2025-03-03 15:17:53,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 15:17:53,277 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1212771758, now seen corresponding path program 1 times [2025-03-03 15:17:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714854463] [2025-03-03 15:17:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:53,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714854463] [2025-03-03 15:17:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714854463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561839862] [2025-03-03 15:17:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:53,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:53,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:53,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:53,475 INFO L87 Difference]: Start difference. First operand 662 states and 815 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:54,131 INFO L93 Difference]: Finished difference Result 1085 states and 1356 transitions. [2025-03-03 15:17:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:54,132 INFO L225 Difference]: With dead ends: 1085 [2025-03-03 15:17:54,132 INFO L226 Difference]: Without dead ends: 991 [2025-03-03 15:17:54,132 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-03-03 15:17:54,133 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 3269 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3269 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:54,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3269 Valid, 3038 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-03 15:17:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 662. [2025-03-03 15:17:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.271875) internal successors, (814), 661 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 814 transitions. [2025-03-03 15:17:54,137 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 814 transitions. Word has length 101 [2025-03-03 15:17:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:54,137 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 814 transitions. [2025-03-03 15:17:54,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 814 transitions. [2025-03-03 15:17:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:54,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:54,138 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] [2025-03-03 15:17:54,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 15:17:54,138 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1063663506, now seen corresponding path program 1 times [2025-03-03 15:17:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422592650] [2025-03-03 15:17:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422592650] [2025-03-03 15:17:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422592650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520675886] [2025-03-03 15:17:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:54,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:54,313 INFO L87 Difference]: Start difference. First operand 662 states and 814 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:54,950 INFO L93 Difference]: Finished difference Result 1034 states and 1285 transitions. [2025-03-03 15:17:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:54,951 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 15:17:54,951 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:54,952 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-03-03 15:17:54,952 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2751 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2751 SdHoareTripleChecker+Valid, 3006 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:54,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2751 Valid, 3006 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2703125) internal successors, (813), 661 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 813 transitions. [2025-03-03 15:17:54,956 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 813 transitions. Word has length 101 [2025-03-03 15:17:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:54,956 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 813 transitions. [2025-03-03 15:17:54,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 813 transitions. [2025-03-03 15:17:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:54,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:54,957 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] [2025-03-03 15:17:54,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 15:17:54,957 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 545755202, now seen corresponding path program 1 times [2025-03-03 15:17:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771443613] [2025-03-03 15:17:54,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:54,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:54,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:54,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:55,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-03-03 15:17:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771443613] [2025-03-03 15:17:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771443613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577294187] [2025-03-03 15:17:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:55,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:55,146 INFO L87 Difference]: Start difference. First operand 662 states and 813 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:55,742 INFO L93 Difference]: Finished difference Result 959 states and 1173 transitions. [2025-03-03 15:17:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:55,743 INFO L225 Difference]: With dead ends: 959 [2025-03-03 15:17:55,743 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:55,744 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-03-03 15:17:55,744 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3822 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3822 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:55,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3822 Valid, 2523 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.26875) internal successors, (812), 661 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 812 transitions. [2025-03-03 15:17:55,749 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 812 transitions. Word has length 101 [2025-03-03 15:17:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:55,749 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 812 transitions. [2025-03-03 15:17:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 812 transitions. [2025-03-03 15:17:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:55,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:55,750 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] [2025-03-03 15:17:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 15:17:55,750 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -551655950, now seen corresponding path program 1 times [2025-03-03 15:17:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138902922] [2025-03-03 15:17:55,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138902922] [2025-03-03 15:17:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138902922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089653580] [2025-03-03 15:17:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:55,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:55,916 INFO L87 Difference]: Start difference. First operand 662 states and 812 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:56,522 INFO L93 Difference]: Finished difference Result 959 states and 1172 transitions. [2025-03-03 15:17:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:56,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:56,523 INFO L225 Difference]: With dead ends: 959 [2025-03-03 15:17:56,523 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:56,523 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-03-03 15:17:56,523 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 3759 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:56,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3759 Valid, 2508 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2671875) internal successors, (811), 661 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 811 transitions. [2025-03-03 15:17:56,528 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 811 transitions. Word has length 101 [2025-03-03 15:17:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:56,528 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 811 transitions. [2025-03-03 15:17:56,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 811 transitions. [2025-03-03 15:17:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:56,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:56,528 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] [2025-03-03 15:17:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 15:17:56,529 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1442026434, now seen corresponding path program 1 times [2025-03-03 15:17:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348557250] [2025-03-03 15:17:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:56,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:56,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:56,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:56,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348557250] [2025-03-03 15:17:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348557250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380561623] [2025-03-03 15:17:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:56,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:56,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:56,836 INFO L87 Difference]: Start difference. First operand 662 states and 811 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:57,719 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2025-03-03 15:17:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:57,721 INFO L225 Difference]: With dead ends: 1147 [2025-03-03 15:17:57,721 INFO L226 Difference]: Without dead ends: 1141 [2025-03-03 15:17:57,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:57,721 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 6999 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6999 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:57,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6999 Valid, 2622 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-03 15:17:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 667. [2025-03-03 15:17:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.2651162790697674) internal successors, (816), 666 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 816 transitions. [2025-03-03 15:17:57,726 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 816 transitions. Word has length 101 [2025-03-03 15:17:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 816 transitions. [2025-03-03 15:17:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 816 transitions. [2025-03-03 15:17:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:57,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:57,727 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] [2025-03-03 15:17:57,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 15:17:57,727 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:57,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -575902018, now seen corresponding path program 1 times [2025-03-03 15:17:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:57,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020515519] [2025-03-03 15:17:57,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:57,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:57,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:57,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:57,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020515519] [2025-03-03 15:17:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020515519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425067485] [2025-03-03 15:17:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:57,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:57,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:57,915 INFO L87 Difference]: Start difference. First operand 667 states and 816 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:58,553 INFO L93 Difference]: Finished difference Result 1031 states and 1277 transitions. [2025-03-03 15:17:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:58,554 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:17:58,554 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:58,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:58,555 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 3541 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3541 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:58,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3541 Valid, 2686 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.265625) internal successors, (810), 661 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 810 transitions. [2025-03-03 15:17:58,559 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 810 transitions. Word has length 101 [2025-03-03 15:17:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 810 transitions. [2025-03-03 15:17:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 810 transitions. [2025-03-03 15:17:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:58,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:58,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] [2025-03-03 15:17:58,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 15:17:58,560 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1547737554, now seen corresponding path program 1 times [2025-03-03 15:17:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407472583] [2025-03-03 15:17:58,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:58,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:58,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:58,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:58,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407472583] [2025-03-03 15:17:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407472583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365891475] [2025-03-03 15:17:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:58,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:58,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:58,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:58,730 INFO L87 Difference]: Start difference. First operand 662 states and 810 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:59,331 INFO L93 Difference]: Finished difference Result 1034 states and 1279 transitions. [2025-03-03 15:17:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:17:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,332 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 15:17:59,332 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:17:59,332 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-03-03 15:17:59,333 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 2876 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2876 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2876 Valid, 2500 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:17:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 662. [2025-03-03 15:17:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.2640625) internal successors, (809), 661 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 809 transitions. [2025-03-03 15:17:59,337 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 809 transitions. Word has length 101 [2025-03-03 15:17:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:59,337 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 809 transitions. [2025-03-03 15:17:59,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 809 transitions. [2025-03-03 15:17:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:59,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:59,338 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] [2025-03-03 15:17:59,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-03 15:17:59,338 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -829895678, now seen corresponding path program 1 times [2025-03-03 15:17:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029021136] [2025-03-03 15:17:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029021136] [2025-03-03 15:17:59,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029021136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:59,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860627405] [2025-03-03 15:17:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:59,533 INFO L87 Difference]: Start difference. First operand 662 states and 809 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:00,189 INFO L93 Difference]: Finished difference Result 1031 states and 1274 transitions. [2025-03-03 15:18:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:18:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:00,190 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 15:18:00,190 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:18:00,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:18:00,191 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 2701 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:00,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 2685 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:18:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 657. [2025-03-03 15:18:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2645669291338584) internal successors, (803), 656 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 803 transitions. [2025-03-03 15:18:00,196 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 803 transitions. Word has length 101 [2025-03-03 15:18:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:00,196 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 803 transitions. [2025-03-03 15:18:00,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 803 transitions. [2025-03-03 15:18:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:00,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:00,197 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] [2025-03-03 15:18:00,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-03 15:18:00,197 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:00,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 504290542, now seen corresponding path program 1 times [2025-03-03 15:18:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666594295] [2025-03-03 15:18:00,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:00,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:00,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:00,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666594295] [2025-03-03 15:18:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666594295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68449333] [2025-03-03 15:18:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:00,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:00,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:00,383 INFO L87 Difference]: Start difference. First operand 657 states and 803 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:00,963 INFO L93 Difference]: Finished difference Result 1034 states and 1276 transitions. [2025-03-03 15:18:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:18:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:00,964 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 15:18:00,964 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:18:00,964 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-03-03 15:18:00,964 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 3740 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3740 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:00,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3740 Valid, 2508 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:18:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 657. [2025-03-03 15:18:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.262992125984252) internal successors, (802), 656 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 802 transitions. [2025-03-03 15:18:00,969 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 802 transitions. Word has length 101 [2025-03-03 15:18:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 802 transitions. [2025-03-03 15:18:00,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 802 transitions. [2025-03-03 15:18:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:00,970 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] [2025-03-03 15:18:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-03 15:18:00,970 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 973863934, now seen corresponding path program 1 times [2025-03-03 15:18:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729494415] [2025-03-03 15:18:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:00,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:01,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:01,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729494415] [2025-03-03 15:18:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729494415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022241703] [2025-03-03 15:18:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:01,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:01,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:01,155 INFO L87 Difference]: Start difference. First operand 657 states and 802 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:01,746 INFO L93 Difference]: Finished difference Result 1034 states and 1274 transitions. [2025-03-03 15:18:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-03-03 15:18:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:01,747 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 15:18:01,747 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 15:18:01,748 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-03-03 15:18:01,748 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3795 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3795 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:01,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3795 Valid, 2523 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 15:18:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 657. [2025-03-03 15:18:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 635 states have (on average 1.2614173228346457) internal successors, (801), 656 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 801 transitions. [2025-03-03 15:18:01,753 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 801 transitions. Word has length 101 [2025-03-03 15:18:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 801 transitions. [2025-03-03 15:18:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 801 transitions. [2025-03-03 15:18:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:01,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,753 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] [2025-03-03 15:18:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-03 15:18:01,754 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1710146206, now seen corresponding path program 1 times [2025-03-03 15:18:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838358549] [2025-03-03 15:18:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:01,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:01,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838358549] [2025-03-03 15:18:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838358549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179799371] [2025-03-03 15:18:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:02,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:02,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:02,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:02,040 INFO L87 Difference]: Start difference. First operand 657 states and 801 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:02,944 INFO L93 Difference]: Finished difference Result 1147 states and 1432 transitions. [2025-03-03 15:18:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:18:02,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 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 101 [2025-03-03 15:18:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:02,945 INFO L225 Difference]: With dead ends: 1147 [2025-03-03 15:18:02,945 INFO L226 Difference]: Without dead ends: 1141 [2025-03-03 15:18:02,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:18:02,946 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 5779 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5779 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:02,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5779 Valid, 2623 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:18:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-03 15:18:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 662. [2025-03-03 15:18:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.259375) internal successors, (806), 661 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 806 transitions. [2025-03-03 15:18:02,951 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 806 transitions. Word has length 101 [2025-03-03 15:18:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 806 transitions. [2025-03-03 15:18:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 806 transitions. [2025-03-03 15:18:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:02,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:02,952 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] [2025-03-03 15:18:02,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-03 15:18:02,952 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:02,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 578490553, now seen corresponding path program 1 times [2025-03-03 15:18:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576775108] [2025-03-03 15:18:02,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:02,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:02,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:02,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:02,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:03,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576775108] [2025-03-03 15:18:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576775108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466095949] [2025-03-03 15:18:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:03,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:03,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:03,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:03,339 INFO L87 Difference]: Start difference. First operand 662 states and 806 transitions. Second operand has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:04,307 INFO L93 Difference]: Finished difference Result 1439 states and 1731 transitions. [2025-03-03 15:18:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 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 102 [2025-03-03 15:18:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:04,308 INFO L225 Difference]: With dead ends: 1439 [2025-03-03 15:18:04,309 INFO L226 Difference]: Without dead ends: 1363 [2025-03-03 15:18:04,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:18:04,312 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 4718 mSDsluCounter, 5350 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4718 SdHoareTripleChecker+Valid, 6270 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:04,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4718 Valid, 6270 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:18:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-03 15:18:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 661. [2025-03-03 15:18:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 639 states have (on average 1.2582159624413145) internal successors, (804), 660 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 804 transitions. [2025-03-03 15:18:04,318 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 804 transitions. Word has length 102 [2025-03-03 15:18:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:04,318 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 804 transitions. [2025-03-03 15:18:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 804 transitions. [2025-03-03 15:18:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:04,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:04,319 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] [2025-03-03 15:18:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-03 15:18:04,319 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -772684503, now seen corresponding path program 1 times [2025-03-03 15:18:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265399659] [2025-03-03 15:18:04,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:04,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265399659] [2025-03-03 15:18:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265399659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321737378] [2025-03-03 15:18:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:04,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:04,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:04,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:04,709 INFO L87 Difference]: Start difference. First operand 661 states and 804 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:05,156 INFO L93 Difference]: Finished difference Result 1040 states and 1299 transitions. [2025-03-03 15:18:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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 102 [2025-03-03 15:18:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:05,157 INFO L225 Difference]: With dead ends: 1040 [2025-03-03 15:18:05,158 INFO L226 Difference]: Without dead ends: 895 [2025-03-03 15:18:05,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:18:05,158 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 2993 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:05,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 5474 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-03 15:18:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 591. [2025-03-03 15:18:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 573 states have (on average 1.2547993019197208) internal successors, (719), 590 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 719 transitions. [2025-03-03 15:18:05,162 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 719 transitions. Word has length 102 [2025-03-03 15:18:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:05,162 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 719 transitions. [2025-03-03 15:18:05,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 719 transitions. [2025-03-03 15:18:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:05,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:05,163 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] [2025-03-03 15:18:05,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-03 15:18:05,163 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:05,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash 353867417, now seen corresponding path program 1 times [2025-03-03 15:18:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28304620] [2025-03-03 15:18:05,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:05,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:05,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28304620] [2025-03-03 15:18:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28304620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:05,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:05,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:05,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314353749] [2025-03-03 15:18:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:05,513 INFO L87 Difference]: Start difference. First operand 591 states and 719 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:05,884 INFO L93 Difference]: Finished difference Result 842 states and 1057 transitions. [2025-03-03 15:18:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:05,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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 102 [2025-03-03 15:18:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:05,885 INFO L225 Difference]: With dead ends: 842 [2025-03-03 15:18:05,885 INFO L226 Difference]: Without dead ends: 630 [2025-03-03 15:18:05,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:18:05,886 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 2859 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2859 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:05,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2859 Valid, 3399 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-03 15:18:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 454. [2025-03-03 15:18:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 441 states have (on average 1.256235827664399) internal successors, (554), 453 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 554 transitions. [2025-03-03 15:18:05,889 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 554 transitions. Word has length 102 [2025-03-03 15:18:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:05,889 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 554 transitions. [2025-03-03 15:18:05,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 554 transitions. [2025-03-03 15:18:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:05,889 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] [2025-03-03 15:18:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-03 15:18:05,889 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1348366857, now seen corresponding path program 1 times [2025-03-03 15:18:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957294470] [2025-03-03 15:18:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:05,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:05,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:05,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:05,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957294470] [2025-03-03 15:18:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957294470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:06,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096524832] [2025-03-03 15:18:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:06,249 INFO L87 Difference]: Start difference. First operand 454 states and 554 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:06,687 INFO L93 Difference]: Finished difference Result 778 states and 979 transitions. [2025-03-03 15:18:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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 102 [2025-03-03 15:18:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:06,688 INFO L225 Difference]: With dead ends: 778 [2025-03-03 15:18:06,688 INFO L226 Difference]: Without dead ends: 648 [2025-03-03 15:18:06,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:18:06,688 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 2307 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 4725 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:06,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 4725 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-03 15:18:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 399. [2025-03-03 15:18:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 387 states have (on average 1.2506459948320414) internal successors, (484), 398 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 484 transitions. [2025-03-03 15:18:06,693 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 484 transitions. Word has length 102 [2025-03-03 15:18:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:06,693 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 484 transitions. [2025-03-03 15:18:06,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 484 transitions. [2025-03-03 15:18:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:06,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:06,694 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] [2025-03-03 15:18:06,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-03 15:18:06,694 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:18:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -153872483, now seen corresponding path program 1 times [2025-03-03 15:18:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55613475] [2025-03-03 15:18:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:06,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:06,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:06,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55613475] [2025-03-03 15:18:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55613475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 15:18:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863679085] [2025-03-03 15:18:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 15:18:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 15:18:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:07,159 INFO L87 Difference]: Start difference. First operand 399 states and 484 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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)