./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef1b718ec14fcc68d212ba49eb2094855200a064b5887a7f2eecdbae8074f363 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:41:16,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:41:16,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:41:16,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:41:16,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:41:16,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:41:16,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:41:16,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:41:16,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:41:16,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:41:16,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:41:16,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:41:16,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:41:16,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:41:16,922 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:41:16,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:41:16,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:41:16,925 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:41:16,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:41:16,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:41:16,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:41:16,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:41:16,927 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef1b718ec14fcc68d212ba49eb2094855200a064b5887a7f2eecdbae8074f363 [2025-02-05 16:41:17,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:41:17,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:41:17,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:41:17,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:41:17,229 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:41:17,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-05 16:41:18,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/073805b40/e10b924c29664839a6e1bc95b37e840d/FLAG6ad0bb378 [2025-02-05 16:41:18,683 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:41:18,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-05 16:41:18,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/073805b40/e10b924c29664839a6e1bc95b37e840d/FLAG6ad0bb378 [2025-02-05 16:41:18,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/073805b40/e10b924c29664839a6e1bc95b37e840d [2025-02-05 16:41:18,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:41:18,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:41:18,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:41:18,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:41:18,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:41:18,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:41:18" (1/1) ... [2025-02-05 16:41:18,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc7c8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:18, skipping insertion in model container [2025-02-05 16:41:18,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:41:18" (1/1) ... [2025-02-05 16:41:18,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:41:19,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11563,11576] [2025-02-05 16:41:19,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15640,15653] [2025-02-05 16:41:19,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16861,16874] [2025-02-05 16:41:19,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17567,17580] [2025-02-05 16:41:19,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19153,19166] [2025-02-05 16:41:19,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19859,19872] [2025-02-05 16:41:19,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20930,20943] [2025-02-05 16:41:19,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23420,23433] [2025-02-05 16:41:19,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24129,24142] [2025-02-05 16:41:19,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25166,25179] [2025-02-05 16:41:19,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27104,27117] [2025-02-05 16:41:19,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31138,31151] [2025-02-05 16:41:19,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31847,31860] [2025-02-05 16:41:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32921,32934] [2025-02-05 16:41:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34896,34909] [2025-02-05 16:41:19,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38277,38290] [2025-02-05 16:41:19,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:41:19,410 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:41:19,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11563,11576] [2025-02-05 16:41:19,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15640,15653] [2025-02-05 16:41:19,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16861,16874] [2025-02-05 16:41:19,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17567,17580] [2025-02-05 16:41:19,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19153,19166] [2025-02-05 16:41:19,481 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19859,19872] [2025-02-05 16:41:19,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20930,20943] [2025-02-05 16:41:19,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23420,23433] [2025-02-05 16:41:19,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24129,24142] [2025-02-05 16:41:19,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25166,25179] [2025-02-05 16:41:19,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27104,27117] [2025-02-05 16:41:19,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31138,31151] [2025-02-05 16:41:19,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31847,31860] [2025-02-05 16:41:19,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32921,32934] [2025-02-05 16:41:19,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34896,34909] [2025-02-05 16:41:19,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38277,38290] [2025-02-05 16:41:19,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:41:19,596 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:41:19,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19 WrapperNode [2025-02-05 16:41:19,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:41:19,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:41:19,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:41:19,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:41:19,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,701 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3758 [2025-02-05 16:41:19,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:41:19,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:41:19,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:41:19,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:41:19,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,758 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-02-05 16:41:19,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:41:19,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:41:19,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:41:19,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:41:19,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (1/1) ... [2025-02-05 16:41:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:41:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:19,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:41:19,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:41:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:41:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:41:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:41:19,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:41:20,023 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:41:20,024 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:41:21,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4991: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2151: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: havoc main_~check__tmp~13#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4597: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~node5__m5~1#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5063: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3743: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2026: havoc main_~node3__m3~4#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168: havoc main_~node5__m5~4#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5132: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L772: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763: havoc main_~node5__m5~8#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-02-05 16:41:21,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: 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-02-05 16:41:21,598 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3680: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4209: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: havoc main_~node3__m3~5#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1833: havoc main_~check__tmp~15#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3815: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2230: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:41:21,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2__m2~2#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1306: havoc main_~node5__m5~5#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2100: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1377: havoc main_~check__tmp~9#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:41:21,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4416: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4945: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1578: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4551: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: havoc main_~node4__m4~6#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: havoc main_~node5__m5~17#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5543: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-02-05 16:41:21,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4091: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: havoc main_~node2__m2~1#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5149: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-02-05 16:41:21,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: havoc main_~node4__m4~8#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4028: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_~node3__m3~2#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453: havoc main_~node3__m3~3#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2841: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4163: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4827: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-05 16:41:21,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1656: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: havoc main_~node5__m5~3#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4433: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4764: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5359: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~node5__m5~10#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3312: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3907: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3__m3~1#1; [2025-02-05 16:41:21,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~node4__m4~7#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3447: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589: havoc main_~node5__m5~14#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5431: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5497: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194: havoc main_~node5__m5~11#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: havoc main_~node4__m4~2#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node4__m4~4#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4045: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3979: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1799: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-02-05 16:41:21,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2659: havoc main_~check__tmp~25#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: havoc main_~check__tmp~20#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1342: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4382: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1212: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: 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-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L949: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4715: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4781: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5707: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: havoc main_~node4__m4~1#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2338: havoc main_~node5__m5~12#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3263: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2801: havoc main_~node4__m4~9#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4255: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5313: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5115: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~node2__m2~3#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc main_~node5__m5~2#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3663: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1483: havoc main_~node5__m5~6#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1153: havoc main_~node4__m4~3#1; [2025-02-05 16:41:21,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1748: havoc main_~node4__m4~5#1; [2025-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~check__tmp~22#1; [2025-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5779: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4327: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1620: havoc main_~node5__m5~7#1; [2025-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: 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-02-05 16:41:21,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1092: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:41:21,738 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2025-02-05 16:41:21,739 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:41:21,764 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:41:21,768 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:41:21,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:41:21 BoogieIcfgContainer [2025-02-05 16:41:21,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:41:21,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:41:21,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:41:21,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:41:21,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:41:18" (1/3) ... [2025-02-05 16:41:21,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e7aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:41:21, skipping insertion in model container [2025-02-05 16:41:21,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:19" (2/3) ... [2025-02-05 16:41:21,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e7aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:41:21, skipping insertion in model container [2025-02-05 16:41:21,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:41:21" (3/3) ... [2025-02-05 16:41:21,777 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-05 16:41:21,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:41:21,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c that has 1 procedures, 629 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-05 16:41:21,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:41:21,856 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;@17a45261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:41:21,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-05 16:41:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:41:21,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:21,871 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] [2025-02-05 16:41:21,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1443651252, now seen corresponding path program 1 times [2025-02-05 16:41:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578477867] [2025-02-05 16:41:21,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:21,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:41:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:41:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:22,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578477867] [2025-02-05 16:41:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578477867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882658840] [2025-02-05 16:41:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:22,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:22,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:22,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:22,412 INFO L87 Difference]: Start difference. First operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 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 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:22,842 INFO L93 Difference]: Finished difference Result 976 states and 1692 transitions. [2025-02-05 16:41:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-05 16:41:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:22,854 INFO L225 Difference]: With dead ends: 976 [2025-02-05 16:41:22,854 INFO L226 Difference]: Without dead ends: 522 [2025-02-05 16:41:22,860 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-02-05 16:41:22,865 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 2581 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:22,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 647 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-05 16:41:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-02-05 16:41:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 506 states have (on average 1.2944664031620554) internal successors, (655), 521 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 655 transitions. [2025-02-05 16:41:22,925 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 655 transitions. Word has length 72 [2025-02-05 16:41:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:22,926 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 655 transitions. [2025-02-05 16:41:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 655 transitions. [2025-02-05 16:41:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:41:22,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:22,932 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] [2025-02-05 16:41:22,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:41:22,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:22,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1674986368, now seen corresponding path program 1 times [2025-02-05 16:41:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654864866] [2025-02-05 16:41:22,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:22,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:41:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:41:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654864866] [2025-02-05 16:41:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654864866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205184542] [2025-02-05 16:41:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:23,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:23,110 INFO L87 Difference]: Start difference. First operand 522 states and 655 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:23,450 INFO L93 Difference]: Finished difference Result 1074 states and 1397 transitions. [2025-02-05 16:41:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-02-05 16:41:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:23,453 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 16:41:23,453 INFO L226 Difference]: Without dead ends: 663 [2025-02-05 16:41:23,453 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-02-05 16:41:23,454 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 2243 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:23,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 506 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-02-05 16:41:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 603. [2025-02-05 16:41:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 587 states have (on average 1.374787052810903) internal successors, (807), 602 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 807 transitions. [2025-02-05 16:41:23,472 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 807 transitions. Word has length 73 [2025-02-05 16:41:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 807 transitions. [2025-02-05 16:41:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 807 transitions. [2025-02-05 16:41:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:41:23,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:23,474 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] [2025-02-05 16:41:23,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:41:23,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:23,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1533947588, now seen corresponding path program 1 times [2025-02-05 16:41:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419774819] [2025-02-05 16:41:23,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:23,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:41:23,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:41:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:23,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:23,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:23,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419774819] [2025-02-05 16:41:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419774819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:23,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930343058] [2025-02-05 16:41:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:23,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:23,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:23,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:23,626 INFO L87 Difference]: Start difference. First operand 603 states and 807 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:23,837 INFO L93 Difference]: Finished difference Result 1095 states and 1496 transitions. [2025-02-05 16:41:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-05 16:41:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:23,839 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 16:41:23,839 INFO L226 Difference]: Without dead ends: 568 [2025-02-05 16:41:23,840 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-02-05 16:41:23,840 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1544 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:23,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 320 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-05 16:41:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-02-05 16:41:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 552 states have (on average 1.3876811594202898) internal successors, (766), 567 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 766 transitions. [2025-02-05 16:41:23,865 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 766 transitions. Word has length 74 [2025-02-05 16:41:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:23,865 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 766 transitions. [2025-02-05 16:41:23,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 766 transitions. [2025-02-05 16:41:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:41:23,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:23,869 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] [2025-02-05 16:41:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:41:23,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1849491976, now seen corresponding path program 1 times [2025-02-05 16:41:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422367330] [2025-02-05 16:41:23,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:41:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:41:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422367330] [2025-02-05 16:41:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422367330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325790533] [2025-02-05 16:41:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:24,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:24,027 INFO L87 Difference]: Start difference. First operand 568 states and 766 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,301 INFO L93 Difference]: Finished difference Result 1060 states and 1453 transitions. [2025-02-05 16:41:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-05 16:41:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,304 INFO L225 Difference]: With dead ends: 1060 [2025-02-05 16:41:24,304 INFO L226 Difference]: Without dead ends: 552 [2025-02-05 16:41:24,305 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-02-05 16:41:24,305 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1474 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 310 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-05 16:41:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-05 16:41:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 536 states have (on average 1.3917910447761195) internal successors, (746), 551 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 746 transitions. [2025-02-05 16:41:24,346 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 746 transitions. Word has length 75 [2025-02-05 16:41:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 746 transitions. [2025-02-05 16:41:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 746 transitions. [2025-02-05 16:41:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:41:24,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,347 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] [2025-02-05 16:41:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:41:24,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:24,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash -105576124, now seen corresponding path program 1 times [2025-02-05 16:41:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824266738] [2025-02-05 16:41:24,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:41:24,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:41:24,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824266738] [2025-02-05 16:41:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824266738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:24,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555232289] [2025-02-05 16:41:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:24,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:24,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:24,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:24,493 INFO L87 Difference]: Start difference. First operand 552 states and 746 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,780 INFO L93 Difference]: Finished difference Result 1044 states and 1431 transitions. [2025-02-05 16:41:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-05 16:41:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,784 INFO L225 Difference]: With dead ends: 1044 [2025-02-05 16:41:24,784 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 16:41:24,785 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-02-05 16:41:24,786 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1419 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 283 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 16:41:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-05 16:41:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3898305084745763) internal successors, (738), 546 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2025-02-05 16:41:24,800 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 76 [2025-02-05 16:41:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,800 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2025-02-05 16:41:24,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2025-02-05 16:41:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:41:24,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,806 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] [2025-02-05 16:41:24,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:41:24,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 894723920, now seen corresponding path program 1 times [2025-02-05 16:41:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885372807] [2025-02-05 16:41:24,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:41:24,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:41:24,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:25,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885372807] [2025-02-05 16:41:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885372807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052078245] [2025-02-05 16:41:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:41:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:41:25,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:41:25,190 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,733 INFO L93 Difference]: Finished difference Result 1054 states and 1401 transitions. [2025-02-05 16:41:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:41:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-05 16:41:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,737 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 16:41:25,738 INFO L226 Difference]: Without dead ends: 778 [2025-02-05 16:41:25,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:41:25,742 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2438 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2438 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2438 Valid, 902 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-05 16:41:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 547. [2025-02-05 16:41:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3879472693032016) internal successors, (737), 546 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2025-02-05 16:41:25,768 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 77 [2025-02-05 16:41:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2025-02-05 16:41:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2025-02-05 16:41:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:41:25,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,770 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] [2025-02-05 16:41:25,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:41:25,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -227637509, now seen corresponding path program 1 times [2025-02-05 16:41:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034430591] [2025-02-05 16:41:25,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:41:25,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:41:25,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034430591] [2025-02-05 16:41:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034430591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200875490] [2025-02-05 16:41:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:26,128 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,619 INFO L93 Difference]: Finished difference Result 808 states and 1110 transitions. [2025-02-05 16:41:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-05 16:41:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,622 INFO L225 Difference]: With dead ends: 808 [2025-02-05 16:41:26,622 INFO L226 Difference]: Without dead ends: 616 [2025-02-05 16:41:26,622 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-02-05 16:41:26,623 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1541 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1261 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-05 16:41:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 547. [2025-02-05 16:41:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3860640301318268) internal successors, (736), 546 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 736 transitions. [2025-02-05 16:41:26,633 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 736 transitions. Word has length 77 [2025-02-05 16:41:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,633 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 736 transitions. [2025-02-05 16:41:26,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 736 transitions. [2025-02-05 16:41:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:41:26,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,634 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] [2025-02-05 16:41:26,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:41:26,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:26,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1029375032, now seen corresponding path program 1 times [2025-02-05 16:41:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593212496] [2025-02-05 16:41:26,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:41:26,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:41:26,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593212496] [2025-02-05 16:41:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593212496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842643903] [2025-02-05 16:41:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:26,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:26,933 INFO L87 Difference]: Start difference. First operand 547 states and 736 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,647 INFO L93 Difference]: Finished difference Result 1029 states and 1412 transitions. [2025-02-05 16:41:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-05 16:41:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,650 INFO L225 Difference]: With dead ends: 1029 [2025-02-05 16:41:27,650 INFO L226 Difference]: Without dead ends: 876 [2025-02-05 16:41:27,650 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-02-05 16:41:27,651 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 2153 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:27,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 1962 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:41:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-02-05 16:41:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 547. [2025-02-05 16:41:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.384180790960452) internal successors, (735), 546 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2025-02-05 16:41:27,661 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 77 [2025-02-05 16:41:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,662 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2025-02-05 16:41:27,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2025-02-05 16:41:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:27,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,664 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] [2025-02-05 16:41:27,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:41:27,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1163182235, now seen corresponding path program 1 times [2025-02-05 16:41:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019200605] [2025-02-05 16:41:27,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:27,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:27,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:27,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019200605] [2025-02-05 16:41:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019200605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:27,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:27,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29791124] [2025-02-05 16:41:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:27,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:27,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:27,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:27,902 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:28,644 INFO L93 Difference]: Finished difference Result 1038 states and 1420 transitions. [2025-02-05 16:41:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:28,647 INFO L225 Difference]: With dead ends: 1038 [2025-02-05 16:41:28,647 INFO L226 Difference]: Without dead ends: 876 [2025-02-05 16:41:28,647 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-02-05 16:41:28,648 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1654 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 1947 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:41:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-02-05 16:41:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 547. [2025-02-05 16:41:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3822975517890772) internal successors, (734), 546 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 734 transitions. [2025-02-05 16:41:28,658 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 734 transitions. Word has length 79 [2025-02-05 16:41:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:28,658 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 734 transitions. [2025-02-05 16:41:28,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 734 transitions. [2025-02-05 16:41:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:28,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:28,660 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] [2025-02-05 16:41:28,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:41:28,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -671347610, now seen corresponding path program 1 times [2025-02-05 16:41:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737972323] [2025-02-05 16:41:28,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:28,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:28,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:28,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737972323] [2025-02-05 16:41:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737972323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808126547] [2025-02-05 16:41:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:28,953 INFO L87 Difference]: Start difference. First operand 547 states and 734 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:29,603 INFO L93 Difference]: Finished difference Result 992 states and 1351 transitions. [2025-02-05 16:41:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:29,606 INFO L225 Difference]: With dead ends: 992 [2025-02-05 16:41:29,606 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:29,607 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-02-05 16:41:29,607 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 1741 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:29,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1568 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 547. [2025-02-05 16:41:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3804143126177024) internal successors, (733), 546 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2025-02-05 16:41:29,618 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 79 [2025-02-05 16:41:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2025-02-05 16:41:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2025-02-05 16:41:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:29,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:29,620 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] [2025-02-05 16:41:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:41:29,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 114423408, now seen corresponding path program 1 times [2025-02-05 16:41:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235616065] [2025-02-05 16:41:29,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:29,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:29,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:29,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:29,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235616065] [2025-02-05 16:41:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235616065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468077981] [2025-02-05 16:41:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:29,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:29,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:29,877 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:30,485 INFO L93 Difference]: Finished difference Result 988 states and 1346 transitions. [2025-02-05 16:41:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:30,488 INFO L225 Difference]: With dead ends: 988 [2025-02-05 16:41:30,488 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:30,489 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-02-05 16:41:30,490 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 2601 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:30,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 1402 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 547. [2025-02-05 16:41:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3785310734463276) internal successors, (732), 546 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 732 transitions. [2025-02-05 16:41:30,500 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 732 transitions. Word has length 79 [2025-02-05 16:41:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:30,501 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 732 transitions. [2025-02-05 16:41:30,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 732 transitions. [2025-02-05 16:41:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:30,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:30,502 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] [2025-02-05 16:41:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:41:30,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -677802200, now seen corresponding path program 1 times [2025-02-05 16:41:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241560941] [2025-02-05 16:41:30,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:30,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:30,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:30,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-02-05 16:41:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241560941] [2025-02-05 16:41:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241560941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048448903] [2025-02-05 16:41:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:30,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:30,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:30,690 INFO L87 Difference]: Start difference. First operand 547 states and 732 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:31,205 INFO L93 Difference]: Finished difference Result 833 states and 1106 transitions. [2025-02-05 16:41:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:31,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:31,208 INFO L225 Difference]: With dead ends: 833 [2025-02-05 16:41:31,208 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:31,208 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-02-05 16:41:31,209 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 1317 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:31,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1224 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3766478342749529) internal successors, (731), 546 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2025-02-05 16:41:31,219 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 79 [2025-02-05 16:41:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2025-02-05 16:41:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2025-02-05 16:41:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:31,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:31,221 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] [2025-02-05 16:41:31,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:41:31,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:31,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2061921712, now seen corresponding path program 1 times [2025-02-05 16:41:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:31,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411490105] [2025-02-05 16:41:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:31,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411490105] [2025-02-05 16:41:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411490105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:31,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892527024] [2025-02-05 16:41:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:31,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:31,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:31,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:31,419 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:31,893 INFO L93 Difference]: Finished difference Result 874 states and 1192 transitions. [2025-02-05 16:41:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:31,896 INFO L225 Difference]: With dead ends: 874 [2025-02-05 16:41:31,896 INFO L226 Difference]: Without dead ends: 616 [2025-02-05 16:41:31,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:41:31,897 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 933 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:31,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1258 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-05 16:41:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 547. [2025-02-05 16:41:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3728813559322033) internal successors, (729), 546 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2025-02-05 16:41:31,905 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 79 [2025-02-05 16:41:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:31,905 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2025-02-05 16:41:31,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2025-02-05 16:41:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:31,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:31,906 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] [2025-02-05 16:41:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:41:31,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1813151767, now seen corresponding path program 1 times [2025-02-05 16:41:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:31,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728592440] [2025-02-05 16:41:31,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:31,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:31,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:31,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:31,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:32,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:32,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728592440] [2025-02-05 16:41:32,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728592440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:32,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:32,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005749938] [2025-02-05 16:41:32,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:32,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:32,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:32,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:32,069 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:32,635 INFO L93 Difference]: Finished difference Result 1048 states and 1426 transitions. [2025-02-05 16:41:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:32,638 INFO L225 Difference]: With dead ends: 1048 [2025-02-05 16:41:32,638 INFO L226 Difference]: Without dead ends: 876 [2025-02-05 16:41:32,638 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-02-05 16:41:32,639 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1040 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:32,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1869 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-02-05 16:41:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 547. [2025-02-05 16:41:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.369114877589454) internal successors, (727), 546 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 727 transitions. [2025-02-05 16:41:32,648 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 727 transitions. Word has length 79 [2025-02-05 16:41:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 727 transitions. [2025-02-05 16:41:32,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 727 transitions. [2025-02-05 16:41:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:32,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:32,649 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] [2025-02-05 16:41:32,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:41:32,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:32,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2039572964, now seen corresponding path program 1 times [2025-02-05 16:41:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627312236] [2025-02-05 16:41:32,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:32,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:32,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:32,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627312236] [2025-02-05 16:41:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627312236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:32,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238247153] [2025-02-05 16:41:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:32,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:32,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:32,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:32,841 INFO L87 Difference]: Start difference. First operand 547 states and 727 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:33,431 INFO L93 Difference]: Finished difference Result 998 states and 1351 transitions. [2025-02-05 16:41:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:33,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:41:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:33,434 INFO L225 Difference]: With dead ends: 998 [2025-02-05 16:41:33,434 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:33,434 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-02-05 16:41:33,435 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 2226 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:33,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 1652 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 547. [2025-02-05 16:41:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 546 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 725 transitions. [2025-02-05 16:41:33,442 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 725 transitions. Word has length 79 [2025-02-05 16:41:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 725 transitions. [2025-02-05 16:41:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 725 transitions. [2025-02-05 16:41:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:33,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:33,443 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] [2025-02-05 16:41:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:41:33,443 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1364762523, now seen corresponding path program 1 times [2025-02-05 16:41:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428769824] [2025-02-05 16:41:33,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:33,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:33,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428769824] [2025-02-05 16:41:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428769824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029079813] [2025-02-05 16:41:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:33,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:33,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:33,626 INFO L87 Difference]: Start difference. First operand 547 states and 725 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:34,195 INFO L93 Difference]: Finished difference Result 961 states and 1289 transitions. [2025-02-05 16:41:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:34,197 INFO L225 Difference]: With dead ends: 961 [2025-02-05 16:41:34,197 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:34,198 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-02-05 16:41:34,198 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2248 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:34,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 1552 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3634651600753296) internal successors, (724), 546 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 724 transitions. [2025-02-05 16:41:34,206 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 724 transitions. Word has length 81 [2025-02-05 16:41:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:34,207 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 724 transitions. [2025-02-05 16:41:34,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 724 transitions. [2025-02-05 16:41:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:34,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:34,208 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] [2025-02-05 16:41:34,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:41:34,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:34,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -696188519, now seen corresponding path program 1 times [2025-02-05 16:41:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634281901] [2025-02-05 16:41:34,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:34,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:34,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:34,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634281901] [2025-02-05 16:41:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634281901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105016951] [2025-02-05 16:41:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:34,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:34,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:34,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:34,382 INFO L87 Difference]: Start difference. First operand 547 states and 724 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:34,865 INFO L93 Difference]: Finished difference Result 997 states and 1343 transitions. [2025-02-05 16:41:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:34,868 INFO L225 Difference]: With dead ends: 997 [2025-02-05 16:41:34,868 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:34,868 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-02-05 16:41:34,868 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1676 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:34,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 1646 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 547. [2025-02-05 16:41:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3615819209039548) internal successors, (723), 546 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2025-02-05 16:41:34,875 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 81 [2025-02-05 16:41:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2025-02-05 16:41:34,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2025-02-05 16:41:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:34,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:34,876 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] [2025-02-05 16:41:34,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:41:34,877 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1091416417, now seen corresponding path program 1 times [2025-02-05 16:41:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860633129] [2025-02-05 16:41:34,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:34,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:34,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:34,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:34,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860633129] [2025-02-05 16:41:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860633129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:35,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:35,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:35,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660105356] [2025-02-05 16:41:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:35,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:35,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:35,081 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:35,607 INFO L93 Difference]: Finished difference Result 958 states and 1284 transitions. [2025-02-05 16:41:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:35,610 INFO L225 Difference]: With dead ends: 958 [2025-02-05 16:41:35,610 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:35,610 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-02-05 16:41:35,610 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2137 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:35,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1786 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.35969868173258) internal successors, (722), 546 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 722 transitions. [2025-02-05 16:41:35,617 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 722 transitions. Word has length 81 [2025-02-05 16:41:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:35,618 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 722 transitions. [2025-02-05 16:41:35,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 722 transitions. [2025-02-05 16:41:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:35,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] [2025-02-05 16:41:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:41:35,619 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1469150714, now seen corresponding path program 1 times [2025-02-05 16:41:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314224214] [2025-02-05 16:41:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:35,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:35,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:35,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314224214] [2025-02-05 16:41:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314224214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:35,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:35,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350621869] [2025-02-05 16:41:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:35,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:35,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:35,768 INFO L87 Difference]: Start difference. First operand 547 states and 722 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:36,256 INFO L93 Difference]: Finished difference Result 961 states and 1286 transitions. [2025-02-05 16:41:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:36,259 INFO L225 Difference]: With dead ends: 961 [2025-02-05 16:41:36,259 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:36,259 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-02-05 16:41:36,260 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1178 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:36,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1466 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3578154425612052) internal successors, (721), 546 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2025-02-05 16:41:36,266 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 81 [2025-02-05 16:41:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:36,267 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2025-02-05 16:41:36,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2025-02-05 16:41:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:36,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:36,268 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] [2025-02-05 16:41:36,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:41:36,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:36,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -278030864, now seen corresponding path program 1 times [2025-02-05 16:41:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969799105] [2025-02-05 16:41:36,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:36,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:36,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969799105] [2025-02-05 16:41:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969799105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:36,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169551697] [2025-02-05 16:41:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:36,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:36,482 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:37,072 INFO L93 Difference]: Finished difference Result 958 states and 1281 transitions. [2025-02-05 16:41:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:37,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:37,075 INFO L225 Difference]: With dead ends: 958 [2025-02-05 16:41:37,075 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:37,076 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-02-05 16:41:37,076 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1743 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:37,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1444 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3559322033898304) internal successors, (720), 546 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 720 transitions. [2025-02-05 16:41:37,085 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 720 transitions. Word has length 81 [2025-02-05 16:41:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 720 transitions. [2025-02-05 16:41:37,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 720 transitions. [2025-02-05 16:41:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:37,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:37,086 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] [2025-02-05 16:41:37,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:41:37,086 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:37,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1553838046, now seen corresponding path program 1 times [2025-02-05 16:41:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407037372] [2025-02-05 16:41:37,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:37,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:37,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:37,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:37,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407037372] [2025-02-05 16:41:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407037372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84330473] [2025-02-05 16:41:37,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:37,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:37,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:37,248 INFO L87 Difference]: Start difference. First operand 547 states and 720 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:37,716 INFO L93 Difference]: Finished difference Result 956 states and 1277 transitions. [2025-02-05 16:41:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:37,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:37,718 INFO L225 Difference]: With dead ends: 956 [2025-02-05 16:41:37,718 INFO L226 Difference]: Without dead ends: 828 [2025-02-05 16:41:37,719 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-02-05 16:41:37,719 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 2166 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:37,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1361 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-05 16:41:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-02-05 16:41:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3540489642184557) internal successors, (719), 546 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-02-05 16:41:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 719 transitions. [2025-02-05 16:41:37,725 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 719 transitions. Word has length 81 [2025-02-05 16:41:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 719 transitions. [2025-02-05 16:41:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 719 transitions. [2025-02-05 16:41:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:37,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:37,726 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] [2025-02-05 16:41:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:41:37,726 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:37,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1616575597, now seen corresponding path program 1 times [2025-02-05 16:41:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556259332] [2025-02-05 16:41:37,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:37,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:37,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:37,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:37,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:38,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-02-05 16:41:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556259332] [2025-02-05 16:41:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556259332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:41:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122012900] [2025-02-05 16:41:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:38,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:38,058 INFO L87 Difference]: Start difference. First operand 547 states and 719 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:38,888 INFO L93 Difference]: Finished difference Result 1404 states and 1931 transitions. [2025-02-05 16:41:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:41:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:38,894 INFO L225 Difference]: With dead ends: 1404 [2025-02-05 16:41:38,894 INFO L226 Difference]: Without dead ends: 1264 [2025-02-05 16:41:38,894 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-02-05 16:41:38,895 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 4063 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:38,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 1840 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:41:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-02-05 16:41:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 551. [2025-02-05 16:41:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3514018691588785) internal successors, (723), 550 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 723 transitions. [2025-02-05 16:41:38,902 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 723 transitions. Word has length 81 [2025-02-05 16:41:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:38,903 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 723 transitions. [2025-02-05 16:41:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 723 transitions. [2025-02-05 16:41:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:38,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:38,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:38,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:41:38,904 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1295580305, now seen corresponding path program 1 times [2025-02-05 16:41:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129195515] [2025-02-05 16:41:38,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:38,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:38,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:38,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:38,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:39,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129195515] [2025-02-05 16:41:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129195515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019177334] [2025-02-05 16:41:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:39,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:39,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:39,088 INFO L87 Difference]: Start difference. First operand 551 states and 723 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:39,649 INFO L93 Difference]: Finished difference Result 962 states and 1282 transitions. [2025-02-05 16:41:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:39,652 INFO L225 Difference]: With dead ends: 962 [2025-02-05 16:41:39,652 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:41:39,652 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-02-05 16:41:39,652 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 2192 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:39,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 1652 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:41:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 551. [2025-02-05 16:41:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3495327102803738) internal successors, (722), 550 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 722 transitions. [2025-02-05 16:41:39,657 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 722 transitions. Word has length 81 [2025-02-05 16:41:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:39,658 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 722 transitions. [2025-02-05 16:41:39,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 722 transitions. [2025-02-05 16:41:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:39,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:39,658 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] [2025-02-05 16:41:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:41:39,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash -105430128, now seen corresponding path program 1 times [2025-02-05 16:41:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284597919] [2025-02-05 16:41:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:39,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:39,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:39,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:39,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284597919] [2025-02-05 16:41:39,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284597919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:39,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583019519] [2025-02-05 16:41:39,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:39,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:39,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:39,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:39,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:39,814 INFO L87 Difference]: Start difference. First operand 551 states and 722 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:40,431 INFO L93 Difference]: Finished difference Result 1072 states and 1440 transitions. [2025-02-05 16:41:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:40,433 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 16:41:40,433 INFO L226 Difference]: Without dead ends: 880 [2025-02-05 16:41:40,434 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-02-05 16:41:40,434 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1522 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:40,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1838 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-05 16:41:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 551. [2025-02-05 16:41:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3457943925233644) internal successors, (720), 550 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 720 transitions. [2025-02-05 16:41:40,440 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 720 transitions. Word has length 81 [2025-02-05 16:41:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 720 transitions. [2025-02-05 16:41:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 720 transitions. [2025-02-05 16:41:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:40,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:40,441 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] [2025-02-05 16:41:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:41:40,442 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 524752274, now seen corresponding path program 1 times [2025-02-05 16:41:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963073853] [2025-02-05 16:41:40,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:40,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:40,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:40,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:40,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:40,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963073853] [2025-02-05 16:41:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963073853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:40,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:40,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119535126] [2025-02-05 16:41:40,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:40,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:40,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:40,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:40,590 INFO L87 Difference]: Start difference. First operand 551 states and 720 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:41,113 INFO L93 Difference]: Finished difference Result 1004 states and 1343 transitions. [2025-02-05 16:41:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:41,116 INFO L225 Difference]: With dead ends: 1004 [2025-02-05 16:41:41,116 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:41,116 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-02-05 16:41:41,116 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 1398 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:41,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1590 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 551. [2025-02-05 16:41:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 550 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 718 transitions. [2025-02-05 16:41:41,126 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 718 transitions. Word has length 81 [2025-02-05 16:41:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:41,126 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 718 transitions. [2025-02-05 16:41:41,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 718 transitions. [2025-02-05 16:41:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:41,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:41,128 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] [2025-02-05 16:41:41,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:41:41,128 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1709263980, now seen corresponding path program 1 times [2025-02-05 16:41:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:41,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74396531] [2025-02-05 16:41:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:41,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:41,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:41,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:41,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74396531] [2025-02-05 16:41:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74396531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698172822] [2025-02-05 16:41:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:41,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:41,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:41,303 INFO L87 Difference]: Start difference. First operand 551 states and 718 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:41,770 INFO L93 Difference]: Finished difference Result 968 states and 1284 transitions. [2025-02-05 16:41:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:41,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:41,772 INFO L225 Difference]: With dead ends: 968 [2025-02-05 16:41:41,772 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:41:41,772 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-02-05 16:41:41,772 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2157 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:41,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 1704 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:41:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 551. [2025-02-05 16:41:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3383177570093459) internal successors, (716), 550 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 716 transitions. [2025-02-05 16:41:41,777 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 716 transitions. Word has length 81 [2025-02-05 16:41:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 716 transitions. [2025-02-05 16:41:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 716 transitions. [2025-02-05 16:41:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:41,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:41,779 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] [2025-02-05 16:41:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:41:41,779 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 975333668, now seen corresponding path program 1 times [2025-02-05 16:41:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036901569] [2025-02-05 16:41:41,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:41,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:41,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:41,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:41,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036901569] [2025-02-05 16:41:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036901569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:41,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987443100] [2025-02-05 16:41:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:41,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:41,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:41,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:41,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:41,924 INFO L87 Difference]: Start difference. First operand 551 states and 716 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:42,328 INFO L93 Difference]: Finished difference Result 837 states and 1087 transitions. [2025-02-05 16:41:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:42,331 INFO L225 Difference]: With dead ends: 837 [2025-02-05 16:41:42,331 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:41:42,331 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-02-05 16:41:42,331 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 2122 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:42,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 1402 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:41:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 551. [2025-02-05 16:41:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3345794392523365) internal successors, (714), 550 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 714 transitions. [2025-02-05 16:41:42,336 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 714 transitions. Word has length 81 [2025-02-05 16:41:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 714 transitions. [2025-02-05 16:41:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 714 transitions. [2025-02-05 16:41:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:42,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:42,337 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] [2025-02-05 16:41:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:41:42,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1353249684, now seen corresponding path program 1 times [2025-02-05 16:41:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845397883] [2025-02-05 16:41:42,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:42,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:42,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:42,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:42,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845397883] [2025-02-05 16:41:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845397883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:42,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062701409] [2025-02-05 16:41:42,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:42,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:42,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:42,493 INFO L87 Difference]: Start difference. First operand 551 states and 714 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:42,920 INFO L93 Difference]: Finished difference Result 964 states and 1273 transitions. [2025-02-05 16:41:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:42,922 INFO L225 Difference]: With dead ends: 964 [2025-02-05 16:41:42,922 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:41:42,922 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-02-05 16:41:42,923 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1687 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:42,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 1710 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:41:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 551. [2025-02-05 16:41:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.330841121495327) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2025-02-05 16:41:42,928 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 81 [2025-02-05 16:41:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:42,928 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2025-02-05 16:41:42,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2025-02-05 16:41:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:42,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:42,929 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] [2025-02-05 16:41:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:41:42,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1748295863, now seen corresponding path program 1 times [2025-02-05 16:41:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495030599] [2025-02-05 16:41:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:42,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:42,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495030599] [2025-02-05 16:41:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495030599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133744574] [2025-02-05 16:41:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:43,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:43,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:43,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:43,072 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:43,511 INFO L93 Difference]: Finished difference Result 869 states and 1133 transitions. [2025-02-05 16:41:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:43,513 INFO L225 Difference]: With dead ends: 869 [2025-02-05 16:41:43,513 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:43,513 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-02-05 16:41:43,518 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1709 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:43,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1575 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 551. [2025-02-05 16:41:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3271028037383177) internal successors, (710), 550 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 710 transitions. [2025-02-05 16:41:43,523 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 710 transitions. Word has length 81 [2025-02-05 16:41:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:43,523 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 710 transitions. [2025-02-05 16:41:43,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 710 transitions. [2025-02-05 16:41:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:43,525 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] [2025-02-05 16:41:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:41:43,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:43,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -485720391, now seen corresponding path program 1 times [2025-02-05 16:41:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46057234] [2025-02-05 16:41:43,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:43,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:43,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46057234] [2025-02-05 16:41:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46057234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:43,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53175791] [2025-02-05 16:41:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:43,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:43,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:43,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:43,659 INFO L87 Difference]: Start difference. First operand 551 states and 710 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:44,096 INFO L93 Difference]: Finished difference Result 837 states and 1079 transitions. [2025-02-05 16:41:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:41:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:44,098 INFO L225 Difference]: With dead ends: 837 [2025-02-05 16:41:44,098 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:41:44,099 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-02-05 16:41:44,099 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1186 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:44,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1459 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:41:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 551. [2025-02-05 16:41:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3233644859813085) internal successors, (708), 550 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 708 transitions. [2025-02-05 16:41:44,104 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 708 transitions. Word has length 81 [2025-02-05 16:41:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:44,105 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 708 transitions. [2025-02-05 16:41:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 708 transitions. [2025-02-05 16:41:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:41:44,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:44,106 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] [2025-02-05 16:41:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:41:44,106 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:44,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash -816890321, now seen corresponding path program 1 times [2025-02-05 16:41:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:44,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125461803] [2025-02-05 16:41:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:44,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:41:44,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:41:44,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:44,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125461803] [2025-02-05 16:41:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125461803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:44,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:44,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943314138] [2025-02-05 16:41:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:44,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:44,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:44,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:44,245 INFO L87 Difference]: Start difference. First operand 551 states and 708 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:44,723 INFO L93 Difference]: Finished difference Result 992 states and 1310 transitions. [2025-02-05 16:41:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 16:41:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:44,725 INFO L225 Difference]: With dead ends: 992 [2025-02-05 16:41:44,725 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 16:41:44,725 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-02-05 16:41:44,725 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1966 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:44,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 1777 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 16:41:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 547. [2025-02-05 16:41:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3239171374764596) internal successors, (703), 546 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 703 transitions. [2025-02-05 16:41:44,730 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 703 transitions. Word has length 82 [2025-02-05 16:41:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 703 transitions. [2025-02-05 16:41:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 703 transitions. [2025-02-05 16:41:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:44,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:44,731 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] [2025-02-05 16:41:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:41:44,732 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:44,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2039270503, now seen corresponding path program 1 times [2025-02-05 16:41:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230211346] [2025-02-05 16:41:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:44,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:44,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:44,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230211346] [2025-02-05 16:41:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230211346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-02-05 16:41:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875960168] [2025-02-05 16:41:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:45,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:41:45,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:45,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:41:45,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:41:45,936 INFO L87 Difference]: Start difference. First operand 547 states and 703 transitions. Second operand has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:49,977 INFO L93 Difference]: Finished difference Result 1233 states and 1636 transitions. [2025-02-05 16:41:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 16:41:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:49,980 INFO L225 Difference]: With dead ends: 1233 [2025-02-05 16:41:49,980 INFO L226 Difference]: Without dead ends: 1101 [2025-02-05 16:41:49,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=495, Invalid=2261, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 16:41:49,981 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 3303 mSDsluCounter, 9805 mSDsCounter, 0 mSdLazyCounter, 6864 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3303 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 6885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:49,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3303 Valid, 10498 Invalid, 6885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6864 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 16:41:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-02-05 16:41:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 563. [2025-02-05 16:41:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 547 states have (on average 1.3217550274223036) internal successors, (723), 562 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 723 transitions. [2025-02-05 16:41:49,993 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 723 transitions. Word has length 83 [2025-02-05 16:41:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:49,994 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 723 transitions. [2025-02-05 16:41:49,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 723 transitions. [2025-02-05 16:41:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:49,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:49,994 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] [2025-02-05 16:41:49,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:41:49,995 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:49,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1511810941, now seen corresponding path program 1 times [2025-02-05 16:41:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904908930] [2025-02-05 16:41:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904908930] [2025-02-05 16:41:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904908930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:51,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-02-05 16:41:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452258731] [2025-02-05 16:41:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:51,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:41:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:41:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:41:51,341 INFO L87 Difference]: Start difference. First operand 563 states and 723 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:55,673 INFO L93 Difference]: Finished difference Result 1392 states and 1843 transitions. [2025-02-05 16:41:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 16:41:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:55,676 INFO L225 Difference]: With dead ends: 1392 [2025-02-05 16:41:55,677 INFO L226 Difference]: Without dead ends: 1263 [2025-02-05 16:41:55,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=505, Invalid=2465, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 16:41:55,678 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 3471 mSDsluCounter, 11533 mSDsCounter, 0 mSdLazyCounter, 7404 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3471 SdHoareTripleChecker+Valid, 12308 SdHoareTripleChecker+Invalid, 7422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:55,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3471 Valid, 12308 Invalid, 7422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 7404 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 16:41:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-02-05 16:41:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 568. [2025-02-05 16:41:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 552 states have (on average 1.3224637681159421) internal successors, (730), 567 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 730 transitions. [2025-02-05 16:41:55,683 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 730 transitions. Word has length 83 [2025-02-05 16:41:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 730 transitions. [2025-02-05 16:41:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 730 transitions. [2025-02-05 16:41:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:55,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:55,684 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] [2025-02-05 16:41:55,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:41:55,685 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1775561573, now seen corresponding path program 1 times [2025-02-05 16:41:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605442612] [2025-02-05 16:41:55,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:55,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:55,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:55,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:55,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605442612] [2025-02-05 16:41:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605442612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 16:41:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274444753] [2025-02-05 16:41:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 16:41:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:56,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 16:41:56,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:41:56,208 INFO L87 Difference]: Start difference. First operand 568 states and 730 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:56,894 INFO L93 Difference]: Finished difference Result 909 states and 1205 transitions. [2025-02-05 16:41:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:41:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:56,896 INFO L225 Difference]: With dead ends: 909 [2025-02-05 16:41:56,896 INFO L226 Difference]: Without dead ends: 651 [2025-02-05 16:41:56,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:41:56,897 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 1999 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:56,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 3442 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-05 16:41:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 498. [2025-02-05 16:41:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 483 states have (on average 1.3229813664596273) internal successors, (639), 497 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 639 transitions. [2025-02-05 16:41:56,902 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 639 transitions. Word has length 83 [2025-02-05 16:41:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 639 transitions. [2025-02-05 16:41:56,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 639 transitions. [2025-02-05 16:41:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:56,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:56,903 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] [2025-02-05 16:41:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:41:56,903 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1241249390, now seen corresponding path program 1 times [2025-02-05 16:41:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:56,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394610551] [2025-02-05 16:41:56,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:56,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:56,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:57,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-02-05 16:41:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394610551] [2025-02-05 16:41:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394610551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829759936] [2025-02-05 16:41:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:57,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:57,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:57,249 INFO L87 Difference]: Start difference. First operand 498 states and 639 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:57,640 INFO L93 Difference]: Finished difference Result 832 states and 1118 transitions. [2025-02-05 16:41:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:57,642 INFO L225 Difference]: With dead ends: 832 [2025-02-05 16:41:57,642 INFO L226 Difference]: Without dead ends: 650 [2025-02-05 16:41:57,643 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-02-05 16:41:57,643 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1831 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 2425 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-05 16:41:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 444. [2025-02-05 16:41:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 432 states have (on average 1.3148148148148149) internal successors, (568), 443 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 568 transitions. [2025-02-05 16:41:57,652 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 568 transitions. Word has length 83 [2025-02-05 16:41:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 568 transitions. [2025-02-05 16:41:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 568 transitions. [2025-02-05 16:41:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:57,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:57,653 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] [2025-02-05 16:41:57,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:41:57,654 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:57,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1676087440, now seen corresponding path program 1 times [2025-02-05 16:41:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:57,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492128881] [2025-02-05 16:41:57,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:57,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:57,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:57,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492128881] [2025-02-05 16:41:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492128881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551456118] [2025-02-05 16:41:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:57,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:57,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:57,991 INFO L87 Difference]: Start difference. First operand 444 states and 568 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:58,476 INFO L93 Difference]: Finished difference Result 801 states and 1062 transitions. [2025-02-05 16:41:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:58,477 INFO L225 Difference]: With dead ends: 801 [2025-02-05 16:41:58,477 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 16:41:58,477 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-02-05 16:41:58,478 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1678 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:58,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 1950 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 16:41:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 434. [2025-02-05 16:41:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 423 states have (on average 1.3073286052009456) internal successors, (553), 433 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 553 transitions. [2025-02-05 16:41:58,481 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 553 transitions. Word has length 83 [2025-02-05 16:41:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:58,482 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 553 transitions. [2025-02-05 16:41:58,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 553 transitions. [2025-02-05 16:41:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:58,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:58,482 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] [2025-02-05 16:41:58,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:41:58,483 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1940426404, now seen corresponding path program 1 times [2025-02-05 16:41:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47417589] [2025-02-05 16:41:58,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:58,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:58,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47417589] [2025-02-05 16:41:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47417589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:58,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160900381] [2025-02-05 16:41:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:58,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:58,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:58,775 INFO L87 Difference]: Start difference. First operand 434 states and 553 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:59,071 INFO L93 Difference]: Finished difference Result 758 states and 1015 transitions. [2025-02-05 16:41:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:59,073 INFO L225 Difference]: With dead ends: 758 [2025-02-05 16:41:59,073 INFO L226 Difference]: Without dead ends: 588 [2025-02-05 16:41:59,073 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-02-05 16:41:59,073 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1670 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:59,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 1872 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-05 16:41:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 392. [2025-02-05 16:41:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.3036649214659686) internal successors, (498), 391 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 498 transitions. [2025-02-05 16:41:59,077 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 498 transitions. Word has length 83 [2025-02-05 16:41:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:59,077 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 498 transitions. [2025-02-05 16:41:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 498 transitions. [2025-02-05 16:41:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:59,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:59,077 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] [2025-02-05 16:41:59,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:41:59,078 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:59,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2058071127, now seen corresponding path program 1 times [2025-02-05 16:41:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464556317] [2025-02-05 16:41:59,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:59,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:59,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:59,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464556317] [2025-02-05 16:41:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464556317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:59,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:41:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773671998] [2025-02-05 16:41:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:59,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:59,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:59,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:59,410 INFO L87 Difference]: Start difference. First operand 392 states and 498 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:59,780 INFO L93 Difference]: Finished difference Result 846 states and 1150 transitions. [2025-02-05 16:41:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:59,781 INFO L225 Difference]: With dead ends: 846 [2025-02-05 16:41:59,781 INFO L226 Difference]: Without dead ends: 664 [2025-02-05 16:41:59,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:41:59,782 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1593 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:59,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 3255 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-02-05 16:41:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 338. [2025-02-05 16:41:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 331 states have (on average 1.3051359516616314) internal successors, (432), 337 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 432 transitions. [2025-02-05 16:41:59,784 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 432 transitions. Word has length 83 [2025-02-05 16:41:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:59,785 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 432 transitions. [2025-02-05 16:41:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 432 transitions. [2025-02-05 16:41:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:41:59,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:59,785 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] [2025-02-05 16:41:59,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:41:59,785 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:41:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash -186727321, now seen corresponding path program 1 times [2025-02-05 16:41:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423270131] [2025-02-05 16:41:59,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:59,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:41:59,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:41:59,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423270131] [2025-02-05 16:42:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423270131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:42:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134346737] [2025-02-05 16:42:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:42:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:00,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:42:00,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:42:00,037 INFO L87 Difference]: Start difference. First operand 338 states and 432 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:00,240 INFO L93 Difference]: Finished difference Result 616 states and 833 transitions. [2025-02-05 16:42:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:42:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 16:42:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:00,241 INFO L225 Difference]: With dead ends: 616 [2025-02-05 16:42:00,241 INFO L226 Difference]: Without dead ends: 419 [2025-02-05 16:42:00,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:42:00,241 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1224 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:00,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 828 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-05 16:42:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 269. [2025-02-05 16:42:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 266 states have (on average 1.3082706766917294) internal successors, (348), 268 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2025-02-05 16:42:00,244 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 84 [2025-02-05 16:42:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:00,244 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2025-02-05 16:42:00,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2025-02-05 16:42:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:42:00,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:00,248 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] [2025-02-05 16:42:00,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:42:00,248 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:00,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1324072453, now seen corresponding path program 1 times [2025-02-05 16:42:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324991245] [2025-02-05 16:42:00,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:00,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:42:00,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:42:00,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:00,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324991245] [2025-02-05 16:42:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324991245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:00,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:42:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858762102] [2025-02-05 16:42:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:42:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:00,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:42:00,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:42:00,472 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:00,921 INFO L93 Difference]: Finished difference Result 1027 states and 1435 transitions. [2025-02-05 16:42:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:42:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 16:42:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:00,923 INFO L225 Difference]: With dead ends: 1027 [2025-02-05 16:42:00,923 INFO L226 Difference]: Without dead ends: 869 [2025-02-05 16:42:00,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:42:00,924 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3033 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:00,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 739 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:42:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-02-05 16:42:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 277. [2025-02-05 16:42:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.2992700729927007) internal successors, (356), 276 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 356 transitions. [2025-02-05 16:42:00,927 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 356 transitions. Word has length 84 [2025-02-05 16:42:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:00,927 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 356 transitions. [2025-02-05 16:42:00,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 356 transitions. [2025-02-05 16:42:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:42:00,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:00,927 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] [2025-02-05 16:42:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:42:00,927 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -999978947, now seen corresponding path program 1 times [2025-02-05 16:42:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065684914] [2025-02-05 16:42:00,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:00,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:42:00,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:42:00,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:00,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065684914] [2025-02-05 16:42:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065684914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:42:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98076486] [2025-02-05 16:42:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:42:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:01,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:42:01,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:42:01,095 INFO L87 Difference]: Start difference. First operand 277 states and 356 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:01,271 INFO L93 Difference]: Finished difference Result 448 states and 593 transitions. [2025-02-05 16:42:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:42:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 16:42:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:01,273 INFO L225 Difference]: With dead ends: 448 [2025-02-05 16:42:01,273 INFO L226 Difference]: Without dead ends: 441 [2025-02-05 16:42:01,273 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-02-05 16:42:01,273 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 936 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:01,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 532 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-05 16:42:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 277. [2025-02-05 16:42:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.2956204379562044) internal successors, (355), 276 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2025-02-05 16:42:01,276 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 84 [2025-02-05 16:42:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:01,276 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2025-02-05 16:42:01,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2025-02-05 16:42:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:42:01,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:01,276 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] [2025-02-05 16:42:01,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:42:01,276 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1316033522, now seen corresponding path program 1 times [2025-02-05 16:42:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624256926] [2025-02-05 16:42:01,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:01,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:42:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:42:01,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:01,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:01,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624256926] [2025-02-05 16:42:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624256926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:42:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774498927] [2025-02-05 16:42:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:01,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:42:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:01,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:42:01,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:42:01,405 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:01,663 INFO L93 Difference]: Finished difference Result 615 states and 831 transitions. [2025-02-05 16:42:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:42:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-05 16:42:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:01,664 INFO L225 Difference]: With dead ends: 615 [2025-02-05 16:42:01,664 INFO L226 Difference]: Without dead ends: 457 [2025-02-05 16:42:01,665 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-02-05 16:42:01,665 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 652 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:01,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 845 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:42:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-05 16:42:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 269. [2025-02-05 16:42:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 266 states have (on average 1.2969924812030076) internal successors, (345), 268 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 345 transitions. [2025-02-05 16:42:01,668 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 345 transitions. Word has length 85 [2025-02-05 16:42:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:01,668 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 345 transitions. [2025-02-05 16:42:01,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 345 transitions. [2025-02-05 16:42:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:42:01,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:01,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] [2025-02-05 16:42:01,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:42:01,668 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1320931749, now seen corresponding path program 1 times [2025-02-05 16:42:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514193039] [2025-02-05 16:42:01,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:01,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:42:01,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:42:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514193039] [2025-02-05 16:42:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514193039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-05 16:42:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646217627] [2025-02-05 16:42:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:42:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:02,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:42:02,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:42:02,643 INFO L87 Difference]: Start difference. First operand 269 states and 345 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:04,138 INFO L93 Difference]: Finished difference Result 294 states and 375 transitions. [2025-02-05 16:42:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 16:42:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 16:42:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:04,139 INFO L225 Difference]: With dead ends: 294 [2025-02-05 16:42:04,139 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 16:42:04,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 16:42:04,140 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 550 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:04,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2463 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:42:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 16:42:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2025-02-05 16:42:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 282 states have (on average 1.2943262411347518) internal successors, (365), 284 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2025-02-05 16:42:04,143 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 86 [2025-02-05 16:42:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:04,143 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2025-02-05 16:42:04,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2025-02-05 16:42:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:42:04,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:04,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:04,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:42:04,143 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:04,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1285527645, now seen corresponding path program 1 times [2025-02-05 16:42:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:04,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216162233] [2025-02-05 16:42:04,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:42:04,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:42:04,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:04,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216162233] [2025-02-05 16:42:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216162233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-05 16:42:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959087708] [2025-02-05 16:42:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:05,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:42:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:42:05,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:42:05,239 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:07,020 INFO L93 Difference]: Finished difference Result 459 states and 607 transitions. [2025-02-05 16:42:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 16:42:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 16:42:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:07,021 INFO L225 Difference]: With dead ends: 459 [2025-02-05 16:42:07,021 INFO L226 Difference]: Without dead ends: 451 [2025-02-05 16:42:07,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 16:42:07,021 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 593 mSDsluCounter, 4691 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:07,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 4965 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:42:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-05 16:42:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 289. [2025-02-05 16:42:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 286 states have (on average 1.2937062937062938) internal successors, (370), 288 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 370 transitions. [2025-02-05 16:42:07,024 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 370 transitions. Word has length 86 [2025-02-05 16:42:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:07,024 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 370 transitions. [2025-02-05 16:42:07,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 370 transitions. [2025-02-05 16:42:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:42:07,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:07,025 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-02-05 16:42:07,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 16:42:07,025 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1242829054, now seen corresponding path program 1 times [2025-02-05 16:42:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421387619] [2025-02-05 16:42:07,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:07,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:42:07,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:42:07,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:07,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421387619] [2025-02-05 16:42:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421387619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:42:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707619540] [2025-02-05 16:42:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:07,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:42:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:42:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:42:07,336 INFO L87 Difference]: Start difference. First operand 289 states and 370 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-02-05 16:42:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:07,753 INFO L93 Difference]: Finished difference Result 443 states and 592 transitions. [2025-02-05 16:42:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:42:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-02-05 16:42:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:07,754 INFO L225 Difference]: With dead ends: 443 [2025-02-05 16:42:07,754 INFO L226 Difference]: Without dead ends: 437 [2025-02-05 16:42:07,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:42:07,754 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 746 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:07,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1348 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-05 16:42:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 277. [2025-02-05 16:42:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 275 states have (on average 1.290909090909091) internal successors, (355), 276 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2025-02-05 16:42:07,757 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 87 [2025-02-05 16:42:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:07,757 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2025-02-05 16:42:07,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-02-05 16:42:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2025-02-05 16:42:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:42:07,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:07,757 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-02-05 16:42:07,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 16:42:07,757 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:07,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1363630340, now seen corresponding path program 1 times [2025-02-05 16:42:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199420993] [2025-02-05 16:42:07,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:07,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:42:07,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:42:07,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:07,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199420993] [2025-02-05 16:42:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199420993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:42:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985186190] [2025-02-05 16:42:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:42:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:42:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:42:08,079 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-02-05 16:42:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:08,548 INFO L93 Difference]: Finished difference Result 751 states and 1031 transitions. [2025-02-05 16:42:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:42:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-02-05 16:42:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:08,549 INFO L225 Difference]: With dead ends: 751 [2025-02-05 16:42:08,549 INFO L226 Difference]: Without dead ends: 736 [2025-02-05 16:42:08,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:42:08,550 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 695 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:08,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 3745 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:42:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-02-05 16:42:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 251. [2025-02-05 16:42:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.296) internal successors, (324), 250 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 324 transitions. [2025-02-05 16:42:08,554 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 324 transitions. Word has length 87 [2025-02-05 16:42:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:08,554 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 324 transitions. [2025-02-05 16:42:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-02-05 16:42:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 324 transitions. [2025-02-05 16:42:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:42:08,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:42:08,555 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash -158315794, now seen corresponding path program 1 times [2025-02-05 16:42:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:08,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315742189] [2025-02-05 16:42:08,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:08,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:08,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:42:08,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:42:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315742189] [2025-02-05 16:42:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315742189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:08,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:08,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068824705] [2025-02-05 16:42:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:08,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:08,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:08,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:08,642 INFO L87 Difference]: Start difference. First operand 251 states and 324 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:08,749 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2025-02-05 16:42:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:42:08,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-02-05 16:42:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:08,751 INFO L225 Difference]: With dead ends: 1531 [2025-02-05 16:42:08,751 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:42:08,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:42:08,751 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1194 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:08,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 2421 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:42:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 377. [2025-02-05 16:42:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.3537234042553192) internal successors, (509), 376 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 509 transitions. [2025-02-05 16:42:08,756 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 509 transitions. Word has length 114 [2025-02-05 16:42:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:08,756 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 509 transitions. [2025-02-05 16:42:08,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 509 transitions. [2025-02-05 16:42:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:08,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:08,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:08,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 16:42:08,757 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1906736050, now seen corresponding path program 1 times [2025-02-05 16:42:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016205819] [2025-02-05 16:42:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:08,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:08,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:08,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:08,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016205819] [2025-02-05 16:42:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016205819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:08,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174794597] [2025-02-05 16:42:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:08,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:08,837 INFO L87 Difference]: Start difference. First operand 377 states and 509 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:08,907 INFO L93 Difference]: Finished difference Result 1775 states and 2570 transitions. [2025-02-05 16:42:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:08,909 INFO L225 Difference]: With dead ends: 1775 [2025-02-05 16:42:08,909 INFO L226 Difference]: Without dead ends: 1521 [2025-02-05 16:42:08,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:08,910 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 957 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:08,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1369 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-02-05 16:42:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 629. [2025-02-05 16:42:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4028662420382165) internal successors, (881), 628 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 881 transitions. [2025-02-05 16:42:08,916 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 881 transitions. Word has length 116 [2025-02-05 16:42:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 881 transitions. [2025-02-05 16:42:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 881 transitions. [2025-02-05 16:42:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:08,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:08,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 16:42:08,917 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 884560914, now seen corresponding path program 1 times [2025-02-05 16:42:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677641782] [2025-02-05 16:42:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:08,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:08,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:08,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:08,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677641782] [2025-02-05 16:42:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677641782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603326516] [2025-02-05 16:42:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:09,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:09,014 INFO L87 Difference]: Start difference. First operand 629 states and 881 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,088 INFO L93 Difference]: Finished difference Result 2027 states and 2942 transitions. [2025-02-05 16:42:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,091 INFO L225 Difference]: With dead ends: 2027 [2025-02-05 16:42:09,091 INFO L226 Difference]: Without dead ends: 1773 [2025-02-05 16:42:09,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:09,091 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 957 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1296 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-02-05 16:42:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1007. [2025-02-05 16:42:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4294234592445327) internal successors, (1438), 1006 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1438 transitions. [2025-02-05 16:42:09,099 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1438 transitions. Word has length 116 [2025-02-05 16:42:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:09,099 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1438 transitions. [2025-02-05 16:42:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1438 transitions. [2025-02-05 16:42:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:09,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:09,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 16:42:09,100 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 952589426, now seen corresponding path program 1 times [2025-02-05 16:42:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701463755] [2025-02-05 16:42:09,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:09,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:09,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701463755] [2025-02-05 16:42:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701463755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269767174] [2025-02-05 16:42:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:09,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:09,187 INFO L87 Difference]: Start difference. First operand 1007 states and 1438 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,264 INFO L93 Difference]: Finished difference Result 2279 states and 3314 transitions. [2025-02-05 16:42:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:09,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,267 INFO L225 Difference]: With dead ends: 2279 [2025-02-05 16:42:09,267 INFO L226 Difference]: Without dead ends: 2025 [2025-02-05 16:42:09,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:09,268 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 996 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1263 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2025-02-05 16:42:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1259. [2025-02-05 16:42:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 1.43879173290938) internal successors, (1810), 1258 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1810 transitions. [2025-02-05 16:42:09,277 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1810 transitions. Word has length 116 [2025-02-05 16:42:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:09,277 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1810 transitions. [2025-02-05 16:42:09,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1810 transitions. [2025-02-05 16:42:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:09,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:09,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 16:42:09,278 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 451450066, now seen corresponding path program 1 times [2025-02-05 16:42:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639074899] [2025-02-05 16:42:09,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:09,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:09,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639074899] [2025-02-05 16:42:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639074899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:09,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767074068] [2025-02-05 16:42:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:09,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:09,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:09,360 INFO L87 Difference]: Start difference. First operand 1259 states and 1810 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,437 INFO L93 Difference]: Finished difference Result 2531 states and 3686 transitions. [2025-02-05 16:42:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,440 INFO L225 Difference]: With dead ends: 2531 [2025-02-05 16:42:09,440 INFO L226 Difference]: Without dead ends: 2277 [2025-02-05 16:42:09,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:09,441 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 1050 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1254 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2025-02-05 16:42:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1511. [2025-02-05 16:42:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 1.4450331125827816) internal successors, (2182), 1510 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2182 transitions. [2025-02-05 16:42:09,469 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2182 transitions. Word has length 116 [2025-02-05 16:42:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:09,469 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2182 transitions. [2025-02-05 16:42:09,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2182 transitions. [2025-02-05 16:42:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:09,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:09,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:09,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 16:42:09,470 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1003160270, now seen corresponding path program 1 times [2025-02-05 16:42:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198477878] [2025-02-05 16:42:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:09,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:09,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198477878] [2025-02-05 16:42:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198477878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518137659] [2025-02-05 16:42:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:09,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:09,562 INFO L87 Difference]: Start difference. First operand 1511 states and 2182 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,644 INFO L93 Difference]: Finished difference Result 2783 states and 4058 transitions. [2025-02-05 16:42:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,647 INFO L225 Difference]: With dead ends: 2783 [2025-02-05 16:42:09,647 INFO L226 Difference]: Without dead ends: 2529 [2025-02-05 16:42:09,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:42:09,648 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 984 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1333 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:42:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2025-02-05 16:42:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 1763. [2025-02-05 16:42:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 1.449489216799092) internal successors, (2554), 1762 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2554 transitions. [2025-02-05 16:42:09,664 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2554 transitions. Word has length 116 [2025-02-05 16:42:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2554 transitions. [2025-02-05 16:42:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2554 transitions. [2025-02-05 16:42:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:09,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:09,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:09,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 16:42:09,665 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -613253435, now seen corresponding path program 1 times [2025-02-05 16:42:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820150448] [2025-02-05 16:42:09,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:09,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:09,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820150448] [2025-02-05 16:42:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820150448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028546863] [2025-02-05 16:42:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:09,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:09,702 INFO L87 Difference]: Start difference. First operand 1763 states and 2554 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,722 INFO L93 Difference]: Finished difference Result 4875 states and 7098 transitions. [2025-02-05 16:42:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,726 INFO L225 Difference]: With dead ends: 4875 [2025-02-05 16:42:09,726 INFO L226 Difference]: Without dead ends: 3235 [2025-02-05 16:42:09,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:09,728 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 83 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 452 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2025-02-05 16:42:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3233. [2025-02-05 16:42:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3232 states have (on average 1.4310024752475248) internal successors, (4625), 3232 states have internal predecessors, (4625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4625 transitions. [2025-02-05 16:42:09,751 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4625 transitions. Word has length 116 [2025-02-05 16:42:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:09,751 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4625 transitions. [2025-02-05 16:42:09,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4625 transitions. [2025-02-05 16:42:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:42:09,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:09,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 16:42:09,752 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -577236116, now seen corresponding path program 1 times [2025-02-05 16:42:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622662426] [2025-02-05 16:42:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:09,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:42:09,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:42:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622662426] [2025-02-05 16:42:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622662426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:42:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120127461] [2025-02-05 16:42:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:09,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:09,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:09,897 INFO L87 Difference]: Start difference. First operand 3233 states and 4625 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:09,980 INFO L93 Difference]: Finished difference Result 6345 states and 9117 transitions. [2025-02-05 16:42:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:42:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 16:42:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:09,984 INFO L225 Difference]: With dead ends: 6345 [2025-02-05 16:42:09,984 INFO L226 Difference]: Without dead ends: 3235 [2025-02-05 16:42:09,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:42:09,986 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 324 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:09,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 551 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2025-02-05 16:42:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3233. [2025-02-05 16:42:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3232 states have (on average 1.4266707920792079) internal successors, (4611), 3232 states have internal predecessors, (4611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4611 transitions. [2025-02-05 16:42:10,008 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4611 transitions. Word has length 116 [2025-02-05 16:42:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:10,008 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4611 transitions. [2025-02-05 16:42:10,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4611 transitions. [2025-02-05 16:42:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 16:42:10,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:10,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:10,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 16:42:10,010 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:10,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1683192023, now seen corresponding path program 1 times [2025-02-05 16:42:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644379126] [2025-02-05 16:42:10,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:10,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 16:42:10,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 16:42:10,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:10,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644379126] [2025-02-05 16:42:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644379126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009854248] [2025-02-05 16:42:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:10,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,081 INFO L87 Difference]: Start difference. First operand 3233 states and 4611 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:10,103 INFO L93 Difference]: Finished difference Result 8179 states and 11691 transitions. [2025-02-05 16:42:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-02-05 16:42:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:10,110 INFO L225 Difference]: With dead ends: 8179 [2025-02-05 16:42:10,110 INFO L226 Difference]: Without dead ends: 5069 [2025-02-05 16:42:10,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,114 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 96 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:10,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 420 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2025-02-05 16:42:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 4859. [2025-02-05 16:42:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4859 states, 4858 states have (on average 1.4151914368052696) internal successors, (6875), 4858 states have internal predecessors, (6875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 6875 transitions. [2025-02-05 16:42:10,152 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 6875 transitions. Word has length 117 [2025-02-05 16:42:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 4859 states and 6875 transitions. [2025-02-05 16:42:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 6875 transitions. [2025-02-05 16:42:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:42:10,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:10,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 16:42:10,153 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -538327815, now seen corresponding path program 1 times [2025-02-05 16:42:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263307878] [2025-02-05 16:42:10,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:10,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:42:10,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:42:10,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:10,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263307878] [2025-02-05 16:42:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263307878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290203577] [2025-02-05 16:42:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,195 INFO L87 Difference]: Start difference. First operand 4859 states and 6875 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:10,223 INFO L93 Difference]: Finished difference Result 9723 states and 13796 transitions. [2025-02-05 16:42:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-05 16:42:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:10,230 INFO L225 Difference]: With dead ends: 9723 [2025-02-05 16:42:10,230 INFO L226 Difference]: Without dead ends: 4987 [2025-02-05 16:42:10,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,235 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 112 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:10,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-02-05 16:42:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4985. [2025-02-05 16:42:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4984 states have (on average 1.404494382022472) internal successors, (7000), 4984 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7000 transitions. [2025-02-05 16:42:10,275 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7000 transitions. Word has length 118 [2025-02-05 16:42:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 7000 transitions. [2025-02-05 16:42:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7000 transitions. [2025-02-05 16:42:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:42:10,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:10,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:10,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 16:42:10,276 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash 459998386, now seen corresponding path program 1 times [2025-02-05 16:42:10,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812862070] [2025-02-05 16:42:10,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:10,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:42:10,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:42:10,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:10,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812862070] [2025-02-05 16:42:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812862070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927550589] [2025-02-05 16:42:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,356 INFO L87 Difference]: Start difference. First operand 4985 states and 7000 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:10,384 INFO L93 Difference]: Finished difference Result 14389 states and 20172 transitions. [2025-02-05 16:42:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-05 16:42:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:10,395 INFO L225 Difference]: With dead ends: 14389 [2025-02-05 16:42:10,395 INFO L226 Difference]: Without dead ends: 9527 [2025-02-05 16:42:10,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,401 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 89 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:10,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9527 states. [2025-02-05 16:42:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9527 to 9205. [2025-02-05 16:42:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9205 states, 9204 states have (on average 1.3934159061277704) internal successors, (12825), 9204 states have internal predecessors, (12825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9205 states to 9205 states and 12825 transitions. [2025-02-05 16:42:10,480 INFO L78 Accepts]: Start accepts. Automaton has 9205 states and 12825 transitions. Word has length 118 [2025-02-05 16:42:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:10,480 INFO L471 AbstractCegarLoop]: Abstraction has 9205 states and 12825 transitions. [2025-02-05 16:42:10,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9205 states and 12825 transitions. [2025-02-05 16:42:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:42:10,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:10,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:10,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 16:42:10,481 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1017243983, now seen corresponding path program 1 times [2025-02-05 16:42:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:10,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236937360] [2025-02-05 16:42:10,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:10,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:42:10,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:42:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:10,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236937360] [2025-02-05 16:42:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236937360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50566088] [2025-02-05 16:42:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:10,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,554 INFO L87 Difference]: Start difference. First operand 9205 states and 12825 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:10,598 INFO L93 Difference]: Finished difference Result 26729 states and 37087 transitions. [2025-02-05 16:42:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:42:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:10,615 INFO L225 Difference]: With dead ends: 26729 [2025-02-05 16:42:10,615 INFO L226 Difference]: Without dead ends: 17647 [2025-02-05 16:42:10,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,626 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 82 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:10,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17647 states. [2025-02-05 16:42:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17647 to 17005. [2025-02-05 16:42:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17005 states, 17004 states have (on average 1.3782051282051282) internal successors, (23435), 17004 states have internal predecessors, (23435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17005 states to 17005 states and 23435 transitions. [2025-02-05 16:42:10,854 INFO L78 Accepts]: Start accepts. Automaton has 17005 states and 23435 transitions. Word has length 119 [2025-02-05 16:42:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:10,854 INFO L471 AbstractCegarLoop]: Abstraction has 17005 states and 23435 transitions. [2025-02-05 16:42:10,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17005 states and 23435 transitions. [2025-02-05 16:42:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:42:10,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:10,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:10,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 16:42:10,855 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 692797247, now seen corresponding path program 1 times [2025-02-05 16:42:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001681937] [2025-02-05 16:42:10,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:10,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:10,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:42:10,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:42:10,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:10,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001681937] [2025-02-05 16:42:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001681937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221204365] [2025-02-05 16:42:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:10,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:10,959 INFO L87 Difference]: Start difference. First operand 17005 states and 23435 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:11,048 INFO L93 Difference]: Finished difference Result 49489 states and 67797 transitions. [2025-02-05 16:42:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:42:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:11,080 INFO L225 Difference]: With dead ends: 49489 [2025-02-05 16:42:11,080 INFO L226 Difference]: Without dead ends: 32607 [2025-02-05 16:42:11,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:11,099 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 75 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:11,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 415 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32607 states. [2025-02-05 16:42:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32607 to 31325. [2025-02-05 16:42:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31325 states, 31324 states have (on average 1.3591814583067297) internal successors, (42575), 31324 states have internal predecessors, (42575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31325 states to 31325 states and 42575 transitions. [2025-02-05 16:42:11,497 INFO L78 Accepts]: Start accepts. Automaton has 31325 states and 42575 transitions. Word has length 120 [2025-02-05 16:42:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 31325 states and 42575 transitions. [2025-02-05 16:42:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 31325 states and 42575 transitions. [2025-02-05 16:42:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:42:11,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:11,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:11,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 16:42:11,499 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 678087868, now seen corresponding path program 1 times [2025-02-05 16:42:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511103665] [2025-02-05 16:42:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:11,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:42:11,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:42:11,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511103665] [2025-02-05 16:42:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511103665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660146826] [2025-02-05 16:42:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:11,589 INFO L87 Difference]: Start difference. First operand 31325 states and 42575 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:11,718 INFO L93 Difference]: Finished difference Result 91169 states and 122977 transitions. [2025-02-05 16:42:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-02-05 16:42:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:11,777 INFO L225 Difference]: With dead ends: 91169 [2025-02-05 16:42:11,777 INFO L226 Difference]: Without dead ends: 59967 [2025-02-05 16:42:11,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:11,808 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 65 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:11,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 414 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59967 states. [2025-02-05 16:42:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59967 to 57405. [2025-02-05 16:42:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57405 states, 57404 states have (on average 1.336056720786008) internal successors, (76695), 57404 states have internal predecessors, (76695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57405 states to 57405 states and 76695 transitions. [2025-02-05 16:42:12,500 INFO L78 Accepts]: Start accepts. Automaton has 57405 states and 76695 transitions. Word has length 121 [2025-02-05 16:42:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 57405 states and 76695 transitions. [2025-02-05 16:42:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57405 states and 76695 transitions. [2025-02-05 16:42:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:42:12,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:12,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:12,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 16:42:12,502 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1836634828, now seen corresponding path program 1 times [2025-02-05 16:42:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292440521] [2025-02-05 16:42:12,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:12,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:42:12,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:42:12,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:12,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292440521] [2025-02-05 16:42:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292440521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:42:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229927815] [2025-02-05 16:42:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:42:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:12,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:42:12,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:42:12,789 INFO L87 Difference]: Start difference. First operand 57405 states and 76695 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:12,918 INFO L93 Difference]: Finished difference Result 58559 states and 78232 transitions. [2025-02-05 16:42:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:42:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-02-05 16:42:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:12,983 INFO L225 Difference]: With dead ends: 58559 [2025-02-05 16:42:12,983 INFO L226 Difference]: Without dead ends: 58557 [2025-02-05 16:42:13,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:42:13,003 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:13,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 933 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58557 states. [2025-02-05 16:42:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58557 to 58557. [2025-02-05 16:42:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58557 states, 58556 states have (on average 1.321794521483708) internal successors, (77399), 58556 states have internal predecessors, (77399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58557 states to 58557 states and 77399 transitions. [2025-02-05 16:42:13,839 INFO L78 Accepts]: Start accepts. Automaton has 58557 states and 77399 transitions. Word has length 122 [2025-02-05 16:42:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 58557 states and 77399 transitions. [2025-02-05 16:42:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 58557 states and 77399 transitions. [2025-02-05 16:42:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:42:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:13,845 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:42:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 16:42:13,845 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -522903402, now seen corresponding path program 1 times [2025-02-05 16:42:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233092085] [2025-02-05 16:42:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:42:13,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:42:13,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:13,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233092085] [2025-02-05 16:42:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233092085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028195631] [2025-02-05 16:42:14,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:14,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:14,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:42:14,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:42:14,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:42:14,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:14,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:14,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:42:14,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:15,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028195631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:16,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-02-05 16:42:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032820866] [2025-02-05 16:42:16,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:42:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:42:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:42:16,349 INFO L87 Difference]: Start difference. First operand 58557 states and 77399 transitions. Second operand has 26 states, 26 states have (on average 15.038461538461538) internal successors, (391), 25 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:18,208 INFO L93 Difference]: Finished difference Result 296133 states and 387882 transitions. [2025-02-05 16:42:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 16:42:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 15.038461538461538) internal successors, (391), 25 states have internal predecessors, (391), 0 states have call successors, (0), 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 154 [2025-02-05 16:42:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:18,466 INFO L225 Difference]: With dead ends: 296133 [2025-02-05 16:42:18,466 INFO L226 Difference]: Without dead ends: 237699 [2025-02-05 16:42:18,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=893, Invalid=3013, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 16:42:18,505 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 3716 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3716 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3716 Valid, 1688 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:42:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237699 states. [2025-02-05 16:42:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237699 to 123851. [2025-02-05 16:42:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123851 states, 123850 states have (on average 1.3123375050464272) internal successors, (162533), 123850 states have internal predecessors, (162533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123851 states to 123851 states and 162533 transitions. [2025-02-05 16:42:20,400 INFO L78 Accepts]: Start accepts. Automaton has 123851 states and 162533 transitions. Word has length 154 [2025-02-05 16:42:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 123851 states and 162533 transitions. [2025-02-05 16:42:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 15.038461538461538) internal successors, (391), 25 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 123851 states and 162533 transitions. [2025-02-05 16:42:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 16:42:20,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:20,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:42:20,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:42:20,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:20,613 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 16:42:20,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1561266167, now seen corresponding path program 1 times [2025-02-05 16:42:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015006234] [2025-02-05 16:42:20,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:20,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 16:42:20,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:42:20,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:20,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015006234] [2025-02-05 16:42:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015006234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23985191] [2025-02-05 16:42:21,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:21,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:42:21,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 16:42:21,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:42:21,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:21,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:21,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 16:42:21,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:22,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23985191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:22,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 32 [2025-02-05 16:42:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172875171] [2025-02-05 16:42:22,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:42:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:22,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:42:22,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:42:22,654 INFO L87 Difference]: Start difference. First operand 123851 states and 162533 transitions. Second operand has 32 states, 32 states have (on average 13.03125) internal successors, (417), 32 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)